/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_BITWISE.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:03:13,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:03:13,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:03:13,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:03:13,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:03:13,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:03:13,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:03:13,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:03:13,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:03:13,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:03:13,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:03:13,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:03:13,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:03:13,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:03:13,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:03:13,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:03:13,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:03:13,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:03:13,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:03:13,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:03:13,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:03:13,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:03:13,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:03:13,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:03:13,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:03:13,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:03:13,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:03:13,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:03:13,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:03:13,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:03:13,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:03:13,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:03:13,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:03:13,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:03:13,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:03:13,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:03:13,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:03:13,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:03:13,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:03:13,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:03:13,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:03:13,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 10:03:13,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:03:13,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:03:13,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:03:13,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:03:13,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:03:13,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:03:13,311 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:03:13,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:03:13,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:03:13,312 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:03:13,313 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:03:13,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:03:13,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:03:13,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:03:13,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:03:13,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:13,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:03:13,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:03:13,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:03:13,315 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:03:13,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:03:13,315 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:03:13,316 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 10:03:13,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:03:13,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:03:13,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:03:13,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:03:13,541 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:03:13,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-01-10 10:03:13,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1804cb9/0b693d340dc54c2681f1445beee21382/FLAGae3f5e844 [2022-01-10 10:03:13,935 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:03:13,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-01-10 10:03:13,945 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1804cb9/0b693d340dc54c2681f1445beee21382/FLAGae3f5e844 [2022-01-10 10:03:13,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f1804cb9/0b693d340dc54c2681f1445beee21382 [2022-01-10 10:03:13,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:03:13,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:03:13,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:13,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:03:13,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:03:13,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:13" (1/1) ... [2022-01-10 10:03:13,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6713757f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:13, skipping insertion in model container [2022-01-10 10:03:13,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:13" (1/1) ... [2022-01-10 10:03:13,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:03:13,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:03:14,143 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_9.c[3555,3568] [2022-01-10 10:03:14,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:14,155 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:03:14,203 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_9.c[3555,3568] [2022-01-10 10:03:14,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:14,214 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:03:14,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14 WrapperNode [2022-01-10 10:03:14,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:14,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:14,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:03:14,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:03:14,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,236 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-01-10 10:03:14,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:14,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:03:14,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:03:14,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:03:14,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:03:14,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:03:14,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:03:14,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:03:14,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:14,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 10:03:14,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 10:03:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:03:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:03:14,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:03:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:03:14,338 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:03:14,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:03:14,447 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:03:14,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:03:14,452 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:03:14,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:14 BoogieIcfgContainer [2022-01-10 10:03:14,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:03:14,454 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:03:14,454 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:03:14,455 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:03:14,457 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:14" (1/1) ... [2022-01-10 10:03:14,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:14 BasicIcfg [2022-01-10 10:03:14,513 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:03:14,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:03:14,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:03:14,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:03:14,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:03:13" (1/4) ... [2022-01-10 10:03:14,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c884ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:14, skipping insertion in model container [2022-01-10 10:03:14,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:14" (2/4) ... [2022-01-10 10:03:14,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c884ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:14, skipping insertion in model container [2022-01-10 10:03:14,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:14" (3/4) ... [2022-01-10 10:03:14,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c884ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:14, skipping insertion in model container [2022-01-10 10:03:14,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:14" (4/4) ... [2022-01-10 10:03:14,518 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.cTransformedIcfg [2022-01-10 10:03:14,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:03:14,521 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:03:14,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:03:14,556 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 10:03:14,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:03:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 10:03:14,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:14,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:14,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 311032436, now seen corresponding path program 1 times [2022-01-10 10:03:14,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:14,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261970084] [2022-01-10 10:03:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:14,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:14,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:14,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261970084] [2022-01-10 10:03:14,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261970084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:14,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:14,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:14,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615905434] [2022-01-10 10:03:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:14,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:14,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:14,820 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:14,859 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2022-01-10 10:03:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:14,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 10:03:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:14,868 INFO L225 Difference]: With dead ends: 77 [2022-01-10 10:03:14,869 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 10:03:14,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:14,877 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:14,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 10:03:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-01-10 10:03:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-01-10 10:03:14,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-01-10 10:03:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:14,911 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-01-10 10:03:14,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-01-10 10:03:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 10:03:14,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:14,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:14,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:03:14,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 440115155, now seen corresponding path program 1 times [2022-01-10 10:03:14,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124101604] [2022-01-10 10:03:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:14,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:14,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:14,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124101604] [2022-01-10 10:03:14,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124101604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:14,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:14,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:14,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891716478] [2022-01-10 10:03:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:14,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:14,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:14,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:14,985 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,010 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-01-10 10:03:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 10:03:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,013 INFO L225 Difference]: With dead ends: 104 [2022-01-10 10:03:15,013 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 10:03:15,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,017 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 10:03:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-01-10 10:03:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-01-10 10:03:15,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-01-10 10:03:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,025 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-01-10 10:03:15,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-01-10 10:03:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:15,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:03:15,026 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1052102913, now seen corresponding path program 1 times [2022-01-10 10:03:15,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972584540] [2022-01-10 10:03:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972584540] [2022-01-10 10:03:15,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972584540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208406411] [2022-01-10 10:03:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,085 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,112 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2022-01-10 10:03:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 10:03:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,114 INFO L225 Difference]: With dead ends: 96 [2022-01-10 10:03:15,114 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 10:03:15,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,118 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 10:03:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-01-10 10:03:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-01-10 10:03:15,122 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-01-10 10:03:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,123 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-01-10 10:03:15,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-01-10 10:03:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:15,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:03:15,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash 758699906, now seen corresponding path program 1 times [2022-01-10 10:03:15,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751180063] [2022-01-10 10:03:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751180063] [2022-01-10 10:03:15,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751180063] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245235962] [2022-01-10 10:03:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,182 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,204 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2022-01-10 10:03:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 10:03:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,205 INFO L225 Difference]: With dead ends: 121 [2022-01-10 10:03:15,205 INFO L226 Difference]: Without dead ends: 119 [2022-01-10 10:03:15,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,206 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-10 10:03:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-01-10 10:03:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-01-10 10:03:15,212 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-01-10 10:03:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,213 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-01-10 10:03:15,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-01-10 10:03:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:15,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:03:15,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 887782625, now seen corresponding path program 1 times [2022-01-10 10:03:15,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157056354] [2022-01-10 10:03:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157056354] [2022-01-10 10:03:15,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157056354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935797197] [2022-01-10 10:03:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,284 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,296 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2022-01-10 10:03:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 10:03:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,298 INFO L225 Difference]: With dead ends: 201 [2022-01-10 10:03:15,298 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 10:03:15,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,300 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 10:03:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-01-10 10:03:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-01-10 10:03:15,316 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-01-10 10:03:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,317 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-01-10 10:03:15,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-01-10 10:03:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:15,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:03:15,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2044892719, now seen corresponding path program 1 times [2022-01-10 10:03:15,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582850094] [2022-01-10 10:03:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582850094] [2022-01-10 10:03:15,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582850094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71656603] [2022-01-10 10:03:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,378 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,392 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2022-01-10 10:03:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 10:03:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,394 INFO L225 Difference]: With dead ends: 180 [2022-01-10 10:03:15,394 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 10:03:15,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,397 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 10:03:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-01-10 10:03:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-01-10 10:03:15,407 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-01-10 10:03:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,407 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-01-10 10:03:15,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-01-10 10:03:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:15,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:03:15,408 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1751489712, now seen corresponding path program 1 times [2022-01-10 10:03:15,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528426008] [2022-01-10 10:03:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528426008] [2022-01-10 10:03:15,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528426008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040871543] [2022-01-10 10:03:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,445 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,459 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2022-01-10 10:03:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 10:03:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,461 INFO L225 Difference]: With dead ends: 225 [2022-01-10 10:03:15,461 INFO L226 Difference]: Without dead ends: 223 [2022-01-10 10:03:15,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,463 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-10 10:03:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2022-01-10 10:03:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.701219512195122) internal successors, (279), 164 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 279 transitions. [2022-01-10 10:03:15,479 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 279 transitions. Word has length 18 [2022-01-10 10:03:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,479 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 279 transitions. [2022-01-10 10:03:15,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 279 transitions. [2022-01-10 10:03:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:15,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:03:15,480 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1880572431, now seen corresponding path program 1 times [2022-01-10 10:03:15,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819656518] [2022-01-10 10:03:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819656518] [2022-01-10 10:03:15,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819656518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475364190] [2022-01-10 10:03:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,505 INFO L87 Difference]: Start difference. First operand 165 states and 279 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,520 INFO L93 Difference]: Finished difference Result 389 states and 661 transitions. [2022-01-10 10:03:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 10:03:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,521 INFO L225 Difference]: With dead ends: 389 [2022-01-10 10:03:15,521 INFO L226 Difference]: Without dead ends: 231 [2022-01-10 10:03:15,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,522 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-10 10:03:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-01-10 10:03:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-01-10 10:03:15,531 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-01-10 10:03:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,533 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-01-10 10:03:15,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-01-10 10:03:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:15,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:03:15,536 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1538361539, now seen corresponding path program 1 times [2022-01-10 10:03:15,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891038723] [2022-01-10 10:03:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891038723] [2022-01-10 10:03:15,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891038723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724612043] [2022-01-10 10:03:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,572 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,584 INFO L93 Difference]: Finished difference Result 345 states and 573 transitions. [2022-01-10 10:03:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 10:03:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,585 INFO L225 Difference]: With dead ends: 345 [2022-01-10 10:03:15,585 INFO L226 Difference]: Without dead ends: 235 [2022-01-10 10:03:15,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,587 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-10 10:03:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2022-01-10 10:03:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 232 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2022-01-10 10:03:15,593 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 19 [2022-01-10 10:03:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,594 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2022-01-10 10:03:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2022-01-10 10:03:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:15,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:03:15,596 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1831764546, now seen corresponding path program 1 times [2022-01-10 10:03:15,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348760512] [2022-01-10 10:03:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348760512] [2022-01-10 10:03:15,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348760512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314730272] [2022-01-10 10:03:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,633 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,644 INFO L93 Difference]: Finished difference Result 425 states and 709 transitions. [2022-01-10 10:03:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 10:03:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,647 INFO L225 Difference]: With dead ends: 425 [2022-01-10 10:03:15,647 INFO L226 Difference]: Without dead ends: 423 [2022-01-10 10:03:15,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,647 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-10 10:03:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 325. [2022-01-10 10:03:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.6141975308641976) internal successors, (523), 324 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 523 transitions. [2022-01-10 10:03:15,657 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 523 transitions. Word has length 19 [2022-01-10 10:03:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,657 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 523 transitions. [2022-01-10 10:03:15,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 523 transitions. [2022-01-10 10:03:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:15,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:03:15,658 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1702681827, now seen corresponding path program 1 times [2022-01-10 10:03:15,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882818732] [2022-01-10 10:03:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,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-10 10:03:15,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882818732] [2022-01-10 10:03:15,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882818732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929072356] [2022-01-10 10:03:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,688 INFO L87 Difference]: Start difference. First operand 325 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,699 INFO L93 Difference]: Finished difference Result 761 states and 1229 transitions. [2022-01-10 10:03:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 10:03:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,701 INFO L225 Difference]: With dead ends: 761 [2022-01-10 10:03:15,701 INFO L226 Difference]: Without dead ends: 447 [2022-01-10 10:03:15,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,705 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-01-10 10:03:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2022-01-10 10:03:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5923423423423424) internal successors, (707), 444 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 707 transitions. [2022-01-10 10:03:15,728 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 707 transitions. Word has length 19 [2022-01-10 10:03:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,728 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 707 transitions. [2022-01-10 10:03:15,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 707 transitions. [2022-01-10 10:03:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:15,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:03:15,729 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -950093717, now seen corresponding path program 1 times [2022-01-10 10:03:15,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380074915] [2022-01-10 10:03:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380074915] [2022-01-10 10:03:15,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380074915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478536980] [2022-01-10 10:03:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,763 INFO L87 Difference]: Start difference. First operand 445 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,776 INFO L93 Difference]: Finished difference Result 669 states and 1057 transitions. [2022-01-10 10:03:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 10:03:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,778 INFO L225 Difference]: With dead ends: 669 [2022-01-10 10:03:15,778 INFO L226 Difference]: Without dead ends: 455 [2022-01-10 10:03:15,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,778 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-01-10 10:03:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-01-10 10:03:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5641592920353982) internal successors, (707), 452 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 707 transitions. [2022-01-10 10:03:15,787 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 707 transitions. Word has length 20 [2022-01-10 10:03:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,788 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 707 transitions. [2022-01-10 10:03:15,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions. [2022-01-10 10:03:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:15,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:03:15,788 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1243496724, now seen corresponding path program 1 times [2022-01-10 10:03:15,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370598481] [2022-01-10 10:03:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370598481] [2022-01-10 10:03:15,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370598481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58689838] [2022-01-10 10:03:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,813 INFO L87 Difference]: Start difference. First operand 453 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,827 INFO L93 Difference]: Finished difference Result 809 states and 1285 transitions. [2022-01-10 10:03:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 10:03:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,830 INFO L225 Difference]: With dead ends: 809 [2022-01-10 10:03:15,830 INFO L226 Difference]: Without dead ends: 807 [2022-01-10 10:03:15,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,831 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-01-10 10:03:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-01-10 10:03:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5201863354037266) internal successors, (979), 644 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 979 transitions. [2022-01-10 10:03:15,852 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 979 transitions. Word has length 20 [2022-01-10 10:03:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,852 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 979 transitions. [2022-01-10 10:03:15,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 979 transitions. [2022-01-10 10:03:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:15,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:03:15,854 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1114414005, now seen corresponding path program 1 times [2022-01-10 10:03:15,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505626846] [2022-01-10 10:03:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505626846] [2022-01-10 10:03:15,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505626846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755579035] [2022-01-10 10:03:15,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,883 INFO L87 Difference]: Start difference. First operand 645 states and 979 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,902 INFO L93 Difference]: Finished difference Result 1497 states and 2277 transitions. [2022-01-10 10:03:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 10:03:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,905 INFO L225 Difference]: With dead ends: 1497 [2022-01-10 10:03:15,905 INFO L226 Difference]: Without dead ends: 871 [2022-01-10 10:03:15,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,907 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-10 10:03:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-01-10 10:03:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.4965437788018434) internal successors, (1299), 868 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1299 transitions. [2022-01-10 10:03:15,924 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1299 transitions. Word has length 20 [2022-01-10 10:03:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,924 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1299 transitions. [2022-01-10 10:03:15,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1299 transitions. [2022-01-10 10:03:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 10:03:15,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:03:15,926 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 106339705, now seen corresponding path program 1 times [2022-01-10 10:03:15,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:15,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919896938] [2022-01-10 10:03:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:15,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:15,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:15,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919896938] [2022-01-10 10:03:15,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919896938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:15,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:15,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:15,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076524673] [2022-01-10 10:03:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:15,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:15,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,957 INFO L87 Difference]: Start difference. First operand 869 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:15,975 INFO L93 Difference]: Finished difference Result 1305 states and 1941 transitions. [2022-01-10 10:03:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-10 10:03:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:15,978 INFO L225 Difference]: With dead ends: 1305 [2022-01-10 10:03:15,978 INFO L226 Difference]: Without dead ends: 887 [2022-01-10 10:03:15,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:15,980 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:15,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-01-10 10:03:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-01-10 10:03:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4694570135746607) internal successors, (1299), 884 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1299 transitions. [2022-01-10 10:03:15,998 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1299 transitions. Word has length 21 [2022-01-10 10:03:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:15,998 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1299 transitions. [2022-01-10 10:03:15,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1299 transitions. [2022-01-10 10:03:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 10:03:15,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:15,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:15,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:03:15,999 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -187063302, now seen corresponding path program 1 times [2022-01-10 10:03:16,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414909071] [2022-01-10 10:03:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414909071] [2022-01-10 10:03:16,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414909071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642401493] [2022-01-10 10:03:16,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,018 INFO L87 Difference]: Start difference. First operand 885 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,041 INFO L93 Difference]: Finished difference Result 1545 states and 2309 transitions. [2022-01-10 10:03:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-10 10:03:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,046 INFO L225 Difference]: With dead ends: 1545 [2022-01-10 10:03:16,046 INFO L226 Difference]: Without dead ends: 1543 [2022-01-10 10:03:16,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,047 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-01-10 10:03:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-01-10 10:03:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4228971962616823) internal successors, (1827), 1284 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1827 transitions. [2022-01-10 10:03:16,072 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1827 transitions. Word has length 21 [2022-01-10 10:03:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,073 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1827 transitions. [2022-01-10 10:03:16,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1827 transitions. [2022-01-10 10:03:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 10:03:16,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 10:03:16,074 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash -57980583, now seen corresponding path program 1 times [2022-01-10 10:03:16,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450542854] [2022-01-10 10:03:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450542854] [2022-01-10 10:03:16,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450542854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025500331] [2022-01-10 10:03:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,091 INFO L87 Difference]: Start difference. First operand 1285 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,116 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2022-01-10 10:03:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-10 10:03:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,121 INFO L225 Difference]: With dead ends: 2953 [2022-01-10 10:03:16,121 INFO L226 Difference]: Without dead ends: 1703 [2022-01-10 10:03:16,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,123 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-01-10 10:03:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-01-10 10:03:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.3947058823529412) internal successors, (2371), 1700 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2371 transitions. [2022-01-10 10:03:16,169 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2371 transitions. Word has length 21 [2022-01-10 10:03:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,169 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2371 transitions. [2022-01-10 10:03:16,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2371 transitions. [2022-01-10 10:03:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 10:03:16,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 10:03:16,171 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1503962457, now seen corresponding path program 1 times [2022-01-10 10:03:16,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736141993] [2022-01-10 10:03:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736141993] [2022-01-10 10:03:16,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736141993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003544925] [2022-01-10 10:03:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,188 INFO L87 Difference]: Start difference. First operand 1701 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,222 INFO L93 Difference]: Finished difference Result 2553 states and 3541 transitions. [2022-01-10 10:03:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-10 10:03:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,226 INFO L225 Difference]: With dead ends: 2553 [2022-01-10 10:03:16,226 INFO L226 Difference]: Without dead ends: 1735 [2022-01-10 10:03:16,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,229 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-01-10 10:03:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-01-10 10:03:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.3689376443418013) internal successors, (2371), 1732 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2371 transitions. [2022-01-10 10:03:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2371 transitions. Word has length 22 [2022-01-10 10:03:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,263 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2371 transitions. [2022-01-10 10:03:16,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2371 transitions. [2022-01-10 10:03:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 10:03:16,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 10:03:16,264 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1797365464, now seen corresponding path program 1 times [2022-01-10 10:03:16,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366739338] [2022-01-10 10:03:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366739338] [2022-01-10 10:03:16,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366739338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705879246] [2022-01-10 10:03:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,285 INFO L87 Difference]: Start difference. First operand 1733 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,321 INFO L93 Difference]: Finished difference Result 2953 states and 4101 transitions. [2022-01-10 10:03:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-10 10:03:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,328 INFO L225 Difference]: With dead ends: 2953 [2022-01-10 10:03:16,328 INFO L226 Difference]: Without dead ends: 2951 [2022-01-10 10:03:16,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,329 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-10 10:03:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-01-10 10:03:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.3241029641185647) internal successors, (3395), 2564 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3395 transitions. [2022-01-10 10:03:16,380 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3395 transitions. Word has length 22 [2022-01-10 10:03:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,381 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3395 transitions. [2022-01-10 10:03:16,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3395 transitions. [2022-01-10 10:03:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 10:03:16,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 10:03:16,384 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1668282745, now seen corresponding path program 1 times [2022-01-10 10:03:16,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825788281] [2022-01-10 10:03:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825788281] [2022-01-10 10:03:16,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825788281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835952707] [2022-01-10 10:03:16,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,410 INFO L87 Difference]: Start difference. First operand 2565 states and 3395 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,453 INFO L93 Difference]: Finished difference Result 5833 states and 7685 transitions. [2022-01-10 10:03:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-10 10:03:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,461 INFO L225 Difference]: With dead ends: 5833 [2022-01-10 10:03:16,461 INFO L226 Difference]: Without dead ends: 3335 [2022-01-10 10:03:16,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,465 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-01-10 10:03:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-01-10 10:03:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.2878151260504203) internal successors, (4291), 3332 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4291 transitions. [2022-01-10 10:03:16,559 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4291 transitions. Word has length 22 [2022-01-10 10:03:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,559 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4291 transitions. [2022-01-10 10:03:16,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4291 transitions. [2022-01-10 10:03:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:16,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 10:03:16,562 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 116278197, now seen corresponding path program 1 times [2022-01-10 10:03:16,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202477245] [2022-01-10 10:03:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202477245] [2022-01-10 10:03:16,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202477245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499047187] [2022-01-10 10:03:16,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,580 INFO L87 Difference]: Start difference. First operand 3333 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,618 INFO L93 Difference]: Finished difference Result 5001 states and 6405 transitions. [2022-01-10 10:03:16,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 10:03:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,626 INFO L225 Difference]: With dead ends: 5001 [2022-01-10 10:03:16,626 INFO L226 Difference]: Without dead ends: 3399 [2022-01-10 10:03:16,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,628 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-01-10 10:03:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-01-10 10:03:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.263545347467609) internal successors, (4291), 3396 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4291 transitions. [2022-01-10 10:03:16,689 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4291 transitions. Word has length 23 [2022-01-10 10:03:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,689 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4291 transitions. [2022-01-10 10:03:16,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4291 transitions. [2022-01-10 10:03:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:16,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 10:03:16,691 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -177124810, now seen corresponding path program 1 times [2022-01-10 10:03:16,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768186083] [2022-01-10 10:03:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768186083] [2022-01-10 10:03:16,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768186083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959216773] [2022-01-10 10:03:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,718 INFO L87 Difference]: Start difference. First operand 3397 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:16,798 INFO L93 Difference]: Finished difference Result 5641 states and 7173 transitions. [2022-01-10 10:03:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 10:03:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:16,817 INFO L225 Difference]: With dead ends: 5641 [2022-01-10 10:03:16,818 INFO L226 Difference]: Without dead ends: 5639 [2022-01-10 10:03:16,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,821 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:16,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-01-10 10:03:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-01-10 10:03:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2246291959406714) internal successors, (6275), 5124 states have internal predecessors, (6275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6275 transitions. [2022-01-10 10:03:16,909 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6275 transitions. Word has length 23 [2022-01-10 10:03:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:16,909 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6275 transitions. [2022-01-10 10:03:16,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6275 transitions. [2022-01-10 10:03:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 10:03:16,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:16,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:16,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 10:03:16,916 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash -48042091, now seen corresponding path program 1 times [2022-01-10 10:03:16,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:16,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56094875] [2022-01-10 10:03:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:16,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:16,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:16,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56094875] [2022-01-10 10:03:16,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56094875] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:16,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:16,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:16,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106286980] [2022-01-10 10:03:16,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:16,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:16,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:16,933 INFO L87 Difference]: Start difference. First operand 5125 states and 6275 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:17,002 INFO L93 Difference]: Finished difference Result 11529 states and 13957 transitions. [2022-01-10 10:03:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 10:03:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:17,019 INFO L225 Difference]: With dead ends: 11529 [2022-01-10 10:03:17,019 INFO L226 Difference]: Without dead ends: 6535 [2022-01-10 10:03:17,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,024 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:17,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-01-10 10:03:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-01-10 10:03:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.1762094304960196) internal successors, (7683), 6532 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7683 transitions. [2022-01-10 10:03:17,175 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7683 transitions. Word has length 23 [2022-01-10 10:03:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:17,175 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7683 transitions. [2022-01-10 10:03:17,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7683 transitions. [2022-01-10 10:03:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:17,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:17,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:17,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 10:03:17,181 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1195868957, now seen corresponding path program 1 times [2022-01-10 10:03:17,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282752787] [2022-01-10 10:03:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:17,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:17,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:17,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282752787] [2022-01-10 10:03:17,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282752787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:17,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:17,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:17,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809763734] [2022-01-10 10:03:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:17,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:17,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,197 INFO L87 Difference]: Start difference. First operand 6533 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:17,257 INFO L93 Difference]: Finished difference Result 9801 states and 11461 transitions. [2022-01-10 10:03:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:17,267 INFO L225 Difference]: With dead ends: 9801 [2022-01-10 10:03:17,268 INFO L226 Difference]: Without dead ends: 6663 [2022-01-10 10:03:17,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,272 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:17,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-01-10 10:03:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-01-10 10:03:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1536036036036037) internal successors, (7683), 6660 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7683 transitions. [2022-01-10 10:03:17,389 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7683 transitions. Word has length 24 [2022-01-10 10:03:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:17,390 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7683 transitions. [2022-01-10 10:03:17,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7683 transitions. [2022-01-10 10:03:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:17,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:17,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:17,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 10:03:17,395 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1489271964, now seen corresponding path program 1 times [2022-01-10 10:03:17,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:17,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692433820] [2022-01-10 10:03:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:17,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:17,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692433820] [2022-01-10 10:03:17,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692433820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:17,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:17,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:17,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541094151] [2022-01-10 10:03:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:17,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:17,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,413 INFO L87 Difference]: Start difference. First operand 6661 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:17,543 INFO L93 Difference]: Finished difference Result 10759 states and 12292 transitions. [2022-01-10 10:03:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:17,558 INFO L225 Difference]: With dead ends: 10759 [2022-01-10 10:03:17,559 INFO L226 Difference]: Without dead ends: 10757 [2022-01-10 10:03:17,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,561 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:17,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-01-10 10:03:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-01-10 10:03:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.124853572823116) internal successors, (11523), 10244 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11523 transitions. [2022-01-10 10:03:17,708 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11523 transitions. Word has length 24 [2022-01-10 10:03:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:17,708 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11523 transitions. [2022-01-10 10:03:17,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11523 transitions. [2022-01-10 10:03:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 10:03:17,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:17,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:17,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 10:03:17,718 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1360189245, now seen corresponding path program 1 times [2022-01-10 10:03:17,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967056665] [2022-01-10 10:03:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:17,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 10:03:17,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:17,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967056665] [2022-01-10 10:03:17,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967056665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:17,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:17,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:17,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334489217] [2022-01-10 10:03:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:17,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:17,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,733 INFO L87 Difference]: Start difference. First operand 10245 states and 11523 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:17,908 INFO L93 Difference]: Finished difference Result 22789 states and 25091 transitions. [2022-01-10 10:03:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 10:03:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:17,909 INFO L225 Difference]: With dead ends: 22789 [2022-01-10 10:03:17,910 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 10:03:17,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:17,925 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:17,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 10:03:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 10:03:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 10:03:17,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-01-10 10:03:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:17,928 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 10:03:17,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 10:03:17,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 10:03:17,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 10:03:17,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 10:03:17,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 10:03:17,939 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L861 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-01-10 10:03:17,940 INFO L861 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L861 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,940 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L854 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 10:03:17,941 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,942 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-10 10:03:17,943 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 10:03:17,943 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-01-10 10:03:17,945 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:17,946 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 10:03:17,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:17 BasicIcfg [2022-01-10 10:03:17,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 10:03:17,953 INFO L158 Benchmark]: Toolchain (without parser) took 3990.31ms. Allocated memory was 174.1MB in the beginning and 411.0MB in the end (delta: 237.0MB). Free memory was 121.4MB in the beginning and 264.7MB in the end (delta: -143.3MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,953 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 10:03:17,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.79ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 148.2MB in the end (delta: -27.0MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.04ms. Allocated memory is still 174.1MB. Free memory was 148.2MB in the beginning and 146.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,953 INFO L158 Benchmark]: Boogie Preprocessor took 14.33ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,954 INFO L158 Benchmark]: RCFGBuilder took 201.60ms. Allocated memory is still 174.1MB. Free memory was 145.2MB in the beginning and 134.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,954 INFO L158 Benchmark]: IcfgTransformer took 58.88ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 129.5MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,954 INFO L158 Benchmark]: TraceAbstraction took 3438.71ms. Allocated memory was 174.1MB in the beginning and 411.0MB in the end (delta: 237.0MB). Free memory was 129.0MB in the beginning and 264.7MB in the end (delta: -135.7MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2022-01-10 10:03:17,955 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.22ms. Allocated memory is still 174.1MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.79ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 148.2MB in the end (delta: -27.0MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.04ms. Allocated memory is still 174.1MB. Free memory was 148.2MB in the beginning and 146.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.33ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 201.60ms. Allocated memory is still 174.1MB. Free memory was 145.2MB in the beginning and 134.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 58.88ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 129.5MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3438.71ms. Allocated memory was 174.1MB in the beginning and 411.0MB in the end (delta: 237.0MB). Free memory was 129.0MB in the beginning and 264.7MB in the end (delta: -135.7MB). Peak memory consumption was 102.8MB. 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: 149]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 3209 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1927 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=25, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 2074 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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: 38]: 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-10 10:03:17,980 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...