/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:59,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:59,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:09:00,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:09:00,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:09:00,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:09:00,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:09:00,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:09:00,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:09:00,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:09:00,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:09:00,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:09:00,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:09:00,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:09:00,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:09:00,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:09:00,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:09:00,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:09:00,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:09:00,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:09:00,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:09:00,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:09:00,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:09:00,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:09:00,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:09:00,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:09:00,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:09:00,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:09:00,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:09:00,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:09:00,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:09:00,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:09:00,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:09:00,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:09:00,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:09:00,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:09:00,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:09:00,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:09:00,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:09:00,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:09:00,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:09:00,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:09:00,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:09:00,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:09:00,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:09:00,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:09:00,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:09:00,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:09:00,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:09:00,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:09:00,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:09:00,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:09:00,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:09:00,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:09:00,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:09:00,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:09:00,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:09:00,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:09:00,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:09:00,113 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:09:00,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:09:00,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:09:00,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:09:00,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:09:00,115 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:09:00,115 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:09:00,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:09:00,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:09:00,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:09:00,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:09:00,321 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:09:00,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2022-01-10 20:09:00,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392c49f7/5be7039b3d4f44b996ba1ecd24458a84/FLAG24aa235c8 [2022-01-10 20:09:00,726 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:09:00,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c [2022-01-10 20:09:00,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392c49f7/5be7039b3d4f44b996ba1ecd24458a84/FLAG24aa235c8 [2022-01-10 20:09:00,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1392c49f7/5be7039b3d4f44b996ba1ecd24458a84 [2022-01-10 20:09:00,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:09:00,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:09:00,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:09:00,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:09:00,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:09:00,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:09:00" (1/1) ... [2022-01-10 20:09:00,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6356b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:00, skipping insertion in model container [2022-01-10 20:09:00,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:09:00" (1/1) ... [2022-01-10 20:09:00,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:09:00,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:09:00,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2022-01-10 20:09:00,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:09:00,963 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:09:00,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_5a.c.cil.c[728,741] [2022-01-10 20:09:00,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:09:01,011 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:09:01,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01 WrapperNode [2022-01-10 20:09:01,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:09:01,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:09:01,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:09:01,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:09:01,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,075 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 276 [2022-01-10 20:09:01,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:09:01,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:09:01,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:09:01,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:09:01,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:09:01,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:09:01,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:09:01,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:09:01,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:09:01,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:01,160 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 20:09:01,175 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 20:09:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:09:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:09:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:09:01,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:09:01,272 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:09:01,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:09:01,537 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:09:01,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:09:01,544 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 20:09:01,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:01 BoogieIcfgContainer [2022-01-10 20:09:01,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:09:01,546 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:09:01,546 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:09:01,547 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:09:01,549 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:01" (1/1) ... [2022-01-10 20:09:01,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:01 BasicIcfg [2022-01-10 20:09:01,705 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:09:01,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:09:01,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:09:01,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:09:01,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:09:00" (1/4) ... [2022-01-10 20:09:01,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fdba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:01, skipping insertion in model container [2022-01-10 20:09:01,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:09:01" (2/4) ... [2022-01-10 20:09:01,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fdba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:01, skipping insertion in model container [2022-01-10 20:09:01,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:01" (3/4) ... [2022-01-10 20:09:01,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fdba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:01, skipping insertion in model container [2022-01-10 20:09:01,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:01" (4/4) ... [2022-01-10 20:09:01,716 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.cTransformedIcfg [2022-01-10 20:09:01,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:09:01,722 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:09:01,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:09:01,794 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 20:09:01,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:09:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 72 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 20:09:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 20:09:01,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,819 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1536015414, now seen corresponding path program 1 times [2022-01-10 20:09:01,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620594806] [2022-01-10 20:09:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,051 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 20:09:02,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620594806] [2022-01-10 20:09:02,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620594806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:02,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397976190] [2022-01-10 20:09:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:02,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:02,085 INFO L87 Difference]: Start difference. First operand has 73 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 72 states have internal predecessors, (125), 0 states have call successors, (0), 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 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 20:09:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,176 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2022-01-10 20:09:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 20:09:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,189 INFO L225 Difference]: With dead ends: 137 [2022-01-10 20:09:02,190 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 20:09:02,197 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 20:09:02,200 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 20:09:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-01-10 20:09:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 20:09:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2022-01-10 20:09:02,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 25 [2022-01-10 20:09:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,243 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2022-01-10 20:09:02,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 20:09:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-01-10 20:09:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 20:09:02,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:09:02,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1242597750, now seen corresponding path program 1 times [2022-01-10 20:09:02,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492483985] [2022-01-10 20:09:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,381 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 20:09:02,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492483985] [2022-01-10 20:09:02,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492483985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:02,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973065399] [2022-01-10 20:09:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:02,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:02,385 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,409 INFO L93 Difference]: Finished difference Result 84 states and 122 transitions. [2022-01-10 20:09:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-10 20:09:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,411 INFO L225 Difference]: With dead ends: 84 [2022-01-10 20:09:02,411 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 20:09:02,412 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 20:09:02,413 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 186 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 20:09:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-10 20:09:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.46875) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 20:09:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-01-10 20:09:02,419 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 28 [2022-01-10 20:09:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,419 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-01-10 20:09:02,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2022-01-10 20:09:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:09:02,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:09:02,421 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1849665854, now seen corresponding path program 1 times [2022-01-10 20:09:02,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551952455] [2022-01-10 20:09:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,493 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 20:09:02,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551952455] [2022-01-10 20:09:02,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551952455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:02,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576722869] [2022-01-10 20:09:02,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:02,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:02,498 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 20:09:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,549 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2022-01-10 20:09:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-10 20:09:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,550 INFO L225 Difference]: With dead ends: 129 [2022-01-10 20:09:02,550 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 20:09:02,551 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 20:09:02,552 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 20:09:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-10 20:09:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 20:09:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2022-01-10 20:09:02,559 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 30 [2022-01-10 20:09:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,559 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2022-01-10 20:09:02,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 20:09:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2022-01-10 20:09:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 20:09:02,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:09:02,561 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -721179066, now seen corresponding path program 1 times [2022-01-10 20:09:02,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726436397] [2022-01-10 20:09:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,715 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 20:09:02,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726436397] [2022-01-10 20:09:02,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726436397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:02,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562785766] [2022-01-10 20:09:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:02,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:02,718 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 20:09:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,904 INFO L93 Difference]: Finished difference Result 196 states and 264 transitions. [2022-01-10 20:09:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:09:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 20:09:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,911 INFO L225 Difference]: With dead ends: 196 [2022-01-10 20:09:02,911 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 20:09:02,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:09:02,923 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 235 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 388 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 20:09:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2022-01-10 20:09:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 20:09:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2022-01-10 20:09:02,948 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 32 [2022-01-10 20:09:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,948 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2022-01-10 20:09:02,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 20:09:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-01-10 20:09:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:09:02,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:09:02,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:02,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1533730274, now seen corresponding path program 1 times [2022-01-10 20:09:02,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399706603] [2022-01-10 20:09:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,056 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 20:09:03,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399706603] [2022-01-10 20:09:03,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399706603] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:03,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219916435] [2022-01-10 20:09:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:03,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:03,062 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,155 INFO L93 Difference]: Finished difference Result 206 states and 290 transitions. [2022-01-10 20:09:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:09:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 20:09:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,157 INFO L225 Difference]: With dead ends: 206 [2022-01-10 20:09:03,157 INFO L226 Difference]: Without dead ends: 172 [2022-01-10 20:09:03,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:09:03,164 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 139 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 375 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-10 20:09:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 136. [2022-01-10 20:09:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.3925925925925926) internal successors, (188), 135 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 20:09:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2022-01-10 20:09:03,182 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 34 [2022-01-10 20:09:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,182 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2022-01-10 20:09:03,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2022-01-10 20:09:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:09:03,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:09:03,184 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 964285663, now seen corresponding path program 1 times [2022-01-10 20:09:03,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412091653] [2022-01-10 20:09:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:03,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412091653] [2022-01-10 20:09:03,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412091653] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:03,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910267620] [2022-01-10 20:09:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:03,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:03,266 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,367 INFO L93 Difference]: Finished difference Result 160 states and 211 transitions. [2022-01-10 20:09:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:09:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 20:09:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,370 INFO L225 Difference]: With dead ends: 160 [2022-01-10 20:09:03,370 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 20:09:03,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:09:03,373 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 95 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 352 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 20:09:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-01-10 20:09:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.375) internal successors, (198), 144 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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 20:09:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-01-10 20:09:03,397 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 34 [2022-01-10 20:09:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,398 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-01-10 20:09:03,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-01-10 20:09:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:09:03,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:09:03,405 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 965209184, now seen corresponding path program 1 times [2022-01-10 20:09:03,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023403186] [2022-01-10 20:09:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,477 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 20:09:03,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023403186] [2022-01-10 20:09:03,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023403186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:09:03,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441050475] [2022-01-10 20:09:03,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:09:03,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:09:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:03,479 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,508 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2022-01-10 20:09:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:09:03,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-10 20:09:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,510 INFO L225 Difference]: With dead ends: 150 [2022-01-10 20:09:03,510 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 20:09:03,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:03,512 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 363 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 20:09:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-01-10 20:09:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 20:09:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2022-01-10 20:09:03,524 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 34 [2022-01-10 20:09:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,525 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2022-01-10 20:09:03,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 20:09:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2022-01-10 20:09:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 20:09:03,526 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:09:03,526 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2002961541, now seen corresponding path program 1 times [2022-01-10 20:09:03,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971513830] [2022-01-10 20:09:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,611 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 20:09:03,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971513830] [2022-01-10 20:09:03,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971513830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:03,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840190922] [2022-01-10 20:09:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:03,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:03,613 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 20:09:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,700 INFO L93 Difference]: Finished difference Result 196 states and 253 transitions. [2022-01-10 20:09:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:09:03,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-01-10 20:09:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,703 INFO L225 Difference]: With dead ends: 196 [2022-01-10 20:09:03,703 INFO L226 Difference]: Without dead ends: 158 [2022-01-10 20:09:03,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:09:03,704 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 417 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-10 20:09:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-01-10 20:09:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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 20:09:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2022-01-10 20:09:03,715 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 35 [2022-01-10 20:09:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,721 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2022-01-10 20:09:03,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 20:09:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2022-01-10 20:09:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 20:09:03,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:09:03,723 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1651682627, now seen corresponding path program 1 times [2022-01-10 20:09:03,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244264770] [2022-01-10 20:09:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,767 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 20:09:03,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244264770] [2022-01-10 20:09:03,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244264770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:09:03,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180235447] [2022-01-10 20:09:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:09:03,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:09:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:03,770 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 20:09:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,806 INFO L93 Difference]: Finished difference Result 192 states and 256 transitions. [2022-01-10 20:09:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:09:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 20:09:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,807 INFO L225 Difference]: With dead ends: 192 [2022-01-10 20:09:03,807 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 20:09:03,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:09:03,811 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 20:09:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-10 20:09:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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 20:09:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-01-10 20:09:03,815 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 36 [2022-01-10 20:09:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,816 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-01-10 20:09:03,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 20:09:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-01-10 20:09:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:09:03,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:09:03,819 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1866800665, now seen corresponding path program 1 times [2022-01-10 20:09:03,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217544007] [2022-01-10 20:09:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:03,903 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 20:09:03,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:03,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217544007] [2022-01-10 20:09:03,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217544007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:03,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:03,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:09:03,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513238670] [2022-01-10 20:09:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:03,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:09:03,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:09:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:09:03,905 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,044 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-01-10 20:09:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 20:09:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-10 20:09:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,045 INFO L225 Difference]: With dead ends: 109 [2022-01-10 20:09:04,045 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 20:09:04,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-10 20:09:04,047 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 166 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 346 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 20:09:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-01-10 20:09:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-01-10 20:09:04,053 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 39 [2022-01-10 20:09:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,053 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-01-10 20:09:04,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-01-10 20:09:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:09:04,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:04,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:04,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:09:04,055 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 359248856, now seen corresponding path program 1 times [2022-01-10 20:09:04,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:04,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746065779] [2022-01-10 20:09:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:04,098 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 20:09:04,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:04,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746065779] [2022-01-10 20:09:04,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746065779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:04,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:04,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:09:04,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308748146] [2022-01-10 20:09:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:04,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:09:04,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:09:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:09:04,101 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,118 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-01-10 20:09:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:09:04,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-10 20:09:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,119 INFO L225 Difference]: With dead ends: 83 [2022-01-10 20:09:04,119 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 20:09:04,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:04,121 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 20:09:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-10 20:09:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 20:09:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-01-10 20:09:04,129 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 39 [2022-01-10 20:09:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,129 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-01-10 20:09:04,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-01-10 20:09:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:09:04,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:04,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:04,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:09:04,130 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1312760558, now seen corresponding path program 1 times [2022-01-10 20:09:04,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:04,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843639479] [2022-01-10 20:09:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:04,219 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 20:09:04,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843639479] [2022-01-10 20:09:04,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843639479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:04,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:04,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:04,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890482253] [2022-01-10 20:09:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:04,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:04,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:04,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:04,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:04,222 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,310 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-01-10 20:09:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 20:09:04,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-10 20:09:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,312 INFO L225 Difference]: With dead ends: 80 [2022-01-10 20:09:04,312 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 20:09:04,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:09:04,312 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 248 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 20:09:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-01-10 20:09:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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 20:09:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-01-10 20:09:04,318 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 39 [2022-01-10 20:09:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,318 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-01-10 20:09:04,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-01-10 20:09:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:09:04,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:04,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:04,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:09:04,319 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1441843277, now seen corresponding path program 1 times [2022-01-10 20:09:04,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194920661] [2022-01-10 20:09:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:04,404 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 20:09:04,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:04,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194920661] [2022-01-10 20:09:04,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194920661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:04,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:04,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:04,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038107150] [2022-01-10 20:09:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:04,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:04,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:04,406 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,478 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-01-10 20:09:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:09:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-01-10 20:09:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,479 INFO L225 Difference]: With dead ends: 96 [2022-01-10 20:09:04,500 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 20:09:04,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:09:04,501 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 307 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 20:09:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-10 20:09:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 20:09:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-01-10 20:09:04,507 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 39 [2022-01-10 20:09:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,507 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-01-10 20:09:04,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 20:09:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-01-10 20:09:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 20:09:04,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:04,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:04,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:09:04,508 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:09:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1531540294, now seen corresponding path program 1 times [2022-01-10 20:09:04,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:04,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948026130] [2022-01-10 20:09:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:04,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:04,592 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 20:09:04,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:04,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948026130] [2022-01-10 20:09:04,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948026130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:04,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:04,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:04,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907004620] [2022-01-10 20:09:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:04,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:04,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:04,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:04,594 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 20:09:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:04,678 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-01-10 20:09:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 20:09:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-01-10 20:09:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:04,678 INFO L225 Difference]: With dead ends: 61 [2022-01-10 20:09:04,678 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 20:09:04,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:09:04,679 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:04,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 195 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 20:09:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 20:09:04,681 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 20:09:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 20:09:04,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-01-10 20:09:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:04,681 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 20:09:04,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 20:09:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 20:09:04,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 20:09:04,683 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 20:09:04,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:09:04,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 20:09:05,255 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 20:09:05,255 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 20:09:05,255 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_base2flt_~__retres4~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 1))) [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L80(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_base2flt_#res#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_base2flt_~__retres4~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_base2flt_~m#1Int| 1))) [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: false [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: false [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: false [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L854 garLoopResultBuilder]: At program point L79-1(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:09:05,256 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,257 INFO L854 garLoopResultBuilder]: At program point L47-3(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,257 INFO L854 garLoopResultBuilder]: At program point L57-5(lines 57 72) the Hoare annotation is: false [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L854 garLoopResultBuilder]: At program point L73-1(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L854 garLoopResultBuilder]: At program point L79-2(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:09:05,257 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L854 garLoopResultBuilder]: At program point L80-2(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,258 INFO L854 garLoopResultBuilder]: At program point L47-5(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,258 INFO L854 garLoopResultBuilder]: At program point L57-8(lines 57 72) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L854 garLoopResultBuilder]: At program point L73-2(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L854 garLoopResultBuilder]: At program point L79-3(lines 28 81) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L35-3(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:09:05,258 INFO L858 garLoopResultBuilder]: For program point L59-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L854 garLoopResultBuilder]: At program point L80-3(lines 24 82) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,259 INFO L854 garLoopResultBuilder]: At program point L47-7(lines 37 52) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,259 INFO L854 garLoopResultBuilder]: At program point L57-11(lines 57 72) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L854 garLoopResultBuilder]: At program point L73-3(lines 35 75) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|)) [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L38-3(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L58-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L47-6(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L59-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:09:05,259 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L854 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~b#1Int| |ULTIMATE.start_ULTIMATE.start_mulflt_~a#1Int|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~__retres10~1#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) .cse2) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~sb~0#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sb~0#1Int|))) [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L854 garLoopResultBuilder]: At program point L217(lines 147 219) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~b#1Int| |ULTIMATE.start_ULTIMATE.start_mulflt_~a#1Int|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_mulflt_#res#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_mulflt_~__retres10~1#1Int| |ULTIMATE.start_ULTIMATE.start_main_~zero~0#1Int|) .cse2) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~sb~0#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sb~0#1Int|))) [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L256-2(lines 256 272) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2022-01-10 20:09:05,260 INFO L858 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L861 garLoopResultBuilder]: At program point L274(lines 220 276) the Hoare annotation is: true [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 15 20) the Hoare annotation is: true [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 20:09:05,261 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 20:09:05,264 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:05,265 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:09:05,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:05 BasicIcfg [2022-01-10 20:09:05,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:09:05,301 INFO L158 Benchmark]: Toolchain (without parser) took 4555.21ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 135.0MB in the beginning and 186.2MB in the end (delta: -51.2MB). Peak memory consumption was 109.8MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,301 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:09:05,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.87ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 134.8MB in the beginning and 211.6MB in the end (delta: -76.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.50ms. Allocated memory is still 241.2MB. Free memory was 211.6MB in the beginning and 208.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,302 INFO L158 Benchmark]: Boogie Preprocessor took 50.15ms. Allocated memory is still 241.2MB. Free memory was 208.9MB in the beginning and 207.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,302 INFO L158 Benchmark]: RCFGBuilder took 418.52ms. Allocated memory is still 241.2MB. Free memory was 207.4MB in the beginning and 190.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,303 INFO L158 Benchmark]: IcfgTransformer took 158.57ms. Allocated memory is still 241.2MB. Free memory was 190.1MB in the beginning and 182.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,303 INFO L158 Benchmark]: TraceAbstraction took 3594.91ms. Allocated memory is still 241.2MB. Free memory was 182.2MB in the beginning and 186.2MB in the end (delta: -4.0MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:05,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.87ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 134.8MB in the beginning and 211.6MB in the end (delta: -76.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.50ms. Allocated memory is still 241.2MB. Free memory was 211.6MB in the beginning and 208.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.15ms. Allocated memory is still 241.2MB. Free memory was 208.9MB in the beginning and 207.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 418.52ms. Allocated memory is still 241.2MB. Free memory was 207.4MB in the beginning and 190.1MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 158.57ms. Allocated memory is still 241.2MB. Free memory was 190.1MB in the beginning and 182.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3594.91ms. Allocated memory is still 241.2MB. Free memory was 182.2MB in the beginning and 186.2MB in the end (delta: -4.0MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 884 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 884 mSDsluCounter, 3823 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2739 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 659 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 1084 mSDtfsCounter, 659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 181 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 62 NumberOfFragments, 200 HoareAnnotationTreeSize, 24 FomulaSimplifications, 4632 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2688 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0bv32 == __retres4 && ~bvule32(m, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To64(m), 1bv33)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (~bvule32(4294967295bv32, sb) || ((((~bvule32(0bv32, zero) && ~bvule32(1bv32, sb)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a))) || (((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (~bvule32(4294967295bv32, sb) || ((((~bvule32(0bv32, zero) && ~bvule32(1bv32, sb)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a))) || ((((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(\result, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0bv32 == __retres4 && ~bvule32(\result, 0bv32)) && ~bvule32(m, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To64(m), 1bv33)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ~bvule32(0bv32, zero) && ~bvule32(zero, 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 20:09:05,365 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...