/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_2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:51,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:51,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:51,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:51,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:51,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:51,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:51,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:51,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:51,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:51,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:51,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:51,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:51,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:51,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:51,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:51,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:51,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:51,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:51,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:51,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:51,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:51,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:51,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:51,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:51,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:51,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:51,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:51,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:51,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:51,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:51,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:51,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:51,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:51,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:51,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:51,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:51,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:51,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:51,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:51,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:51,736 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:08:51,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:51,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:51,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:51,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:51,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:51,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:51,758 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:51,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:51,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:51,759 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:51,760 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:51,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:51,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:51,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:51,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:51,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:51,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:51,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:51,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:51,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:51,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:51,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:51,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:51,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:51,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:51,762 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:51,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:51,763 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:51,763 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:08:51,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:52,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:52,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:52,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:52,013 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:52,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 20:08:52,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f5d85a/deb952565b624e7fb7c64e92ae8e93bb/FLAGb489fd6cb [2022-01-10 20:08:52,487 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:52,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_2a.c.cil.c [2022-01-10 20:08:52,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f5d85a/deb952565b624e7fb7c64e92ae8e93bb/FLAGb489fd6cb [2022-01-10 20:08:52,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f5d85a/deb952565b624e7fb7c64e92ae8e93bb [2022-01-10 20:08:52,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:52,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:52,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:52,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:52,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:52,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:52" (1/1) ... [2022-01-10 20:08:52,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad6428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:52, skipping insertion in model container [2022-01-10 20:08:52,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:52" (1/1) ... [2022-01-10 20:08:52,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:52,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:53,054 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_2a.c.cil.c[728,741] [2022-01-10 20:08:53,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:53,100 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:53,109 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_2a.c.cil.c[728,741] [2022-01-10 20:08:53,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:53,140 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:53,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53 WrapperNode [2022-01-10 20:08:53,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:53,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:53,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:53,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:53,148 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:08:53" (1/1) ... [2022-01-10 20:08:53,159 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:08:53" (1/1) ... [2022-01-10 20:08:53,184 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 276 [2022-01-10 20:08:53,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:53,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:53,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:53,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:53,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:53,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:53,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:53,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:53,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:53,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:53,252 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:08:53,257 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:08:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:53,367 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:53,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:53,745 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:53,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:53,751 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 20:08:53,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:53 BoogieIcfgContainer [2022-01-10 20:08:53,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:53,754 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:53,754 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:53,757 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:53,760 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:53" (1/1) ... [2022-01-10 20:08:53,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:53 BasicIcfg [2022-01-10 20:08:53,870 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:53,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:53,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:53,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:53,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:52" (1/4) ... [2022-01-10 20:08:53,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80a11e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:53, skipping insertion in model container [2022-01-10 20:08:53,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:53" (2/4) ... [2022-01-10 20:08:53,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80a11e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:53, skipping insertion in model container [2022-01-10 20:08:53,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:53" (3/4) ... [2022-01-10 20:08:53,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80a11e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:53, skipping insertion in model container [2022-01-10 20:08:53,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:53" (4/4) ... [2022-01-10 20:08:53,880 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.cTransformedIcfg [2022-01-10 20:08:53,884 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:53,884 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:08:53,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:53,928 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:08:53,928 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:08:53,945 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:08:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 20:08:53,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:53,952 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:08:53,953 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1536015414, now seen corresponding path program 1 times [2022-01-10 20:08:53,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917233437] [2022-01-10 20:08:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:53,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:54,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917233437] [2022-01-10 20:08:54,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917233437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:54,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998606285] [2022-01-10 20:08:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:54,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:54,164 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:08:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,272 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2022-01-10 20:08:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:54,274 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:08:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,286 INFO L225 Difference]: With dead ends: 137 [2022-01-10 20:08:54,286 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 20:08:54,289 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:08:54,294 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:08:54,295 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:08:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 20:08:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-01-10 20:08:54,333 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:08:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2022-01-10 20:08:54,338 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 25 [2022-01-10 20:08:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,339 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2022-01-10 20:08:54,339 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:08:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2022-01-10 20:08:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 20:08:54,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,341 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:08:54,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:54,342 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1242597750, now seen corresponding path program 1 times [2022-01-10 20:08:54,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222912473] [2022-01-10 20:08:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,475 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:08:54,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222912473] [2022-01-10 20:08:54,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222912473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:54,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298338403] [2022-01-10 20:08:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:54,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:54,479 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:08:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,490 INFO L93 Difference]: Finished difference Result 84 states and 122 transitions. [2022-01-10 20:08:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:54,490 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:08:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,491 INFO L225 Difference]: With dead ends: 84 [2022-01-10 20:08:54,491 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 20:08:54,492 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:08:54,493 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:08:54,493 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:08:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 20:08:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-10 20:08:54,499 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:08:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-01-10 20:08:54,500 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 28 [2022-01-10 20:08:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,500 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-01-10 20:08:54,500 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:08:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2022-01-10 20:08:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:08:54,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,502 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:08:54,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:54,502 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1849665854, now seen corresponding path program 1 times [2022-01-10 20:08:54,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73692499] [2022-01-10 20:08:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,606 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:08:54,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73692499] [2022-01-10 20:08:54,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73692499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:54,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680538948] [2022-01-10 20:08:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:54,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:54,611 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:08:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,673 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2022-01-10 20:08:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:54,675 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:08:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,676 INFO L225 Difference]: With dead ends: 129 [2022-01-10 20:08:54,676 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 20:08:54,676 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:08:54,677 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:08:54,678 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:08:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 20:08:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-01-10 20:08:54,683 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:08:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2022-01-10 20:08:54,684 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 30 [2022-01-10 20:08:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:54,684 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2022-01-10 20:08:54,684 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:08:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2022-01-10 20:08:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 20:08:54,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:54,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:54,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:08:54,685 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash -721179066, now seen corresponding path program 1 times [2022-01-10 20:08:54,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:54,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213832156] [2022-01-10 20:08:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:54,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:54,815 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:08:54,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213832156] [2022-01-10 20:08:54,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213832156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:54,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:54,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:54,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451342093] [2022-01-10 20:08:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:54,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:54,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:54,818 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:08:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:54,990 INFO L93 Difference]: Finished difference Result 196 states and 264 transitions. [2022-01-10 20:08:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:08:54,991 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:08:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:54,994 INFO L225 Difference]: With dead ends: 196 [2022-01-10 20:08:54,994 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 20:08:54,994 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:08:55,003 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:08:55,004 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:08:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 20:08:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2022-01-10 20:08:55,023 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:08:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2022-01-10 20:08:55,023 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 32 [2022-01-10 20:08:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,024 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2022-01-10 20:08:55,024 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:08:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2022-01-10 20:08:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:08:55,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,025 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:08:55,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:08:55,026 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1533730274, now seen corresponding path program 1 times [2022-01-10 20:08:55,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907368133] [2022-01-10 20:08:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,108 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:08:55,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907368133] [2022-01-10 20:08:55,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907368133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:55,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986919835] [2022-01-10 20:08:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:55,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:55,111 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:08:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,204 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2022-01-10 20:08:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:55,205 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:08:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,206 INFO L225 Difference]: With dead ends: 200 [2022-01-10 20:08:55,206 INFO L226 Difference]: Without dead ends: 172 [2022-01-10 20:08:55,206 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:08:55,207 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 142 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:55,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 382 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-10 20:08:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 136. [2022-01-10 20:08:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 135 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:08:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2022-01-10 20:08:55,225 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 34 [2022-01-10 20:08:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,225 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2022-01-10 20:08:55,225 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:08:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2022-01-10 20:08:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:08:55,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,226 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:08:55,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:08:55,227 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash 964285663, now seen corresponding path program 1 times [2022-01-10 20:08:55,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313344035] [2022-01-10 20:08:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,301 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:08:55,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313344035] [2022-01-10 20:08:55,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313344035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:55,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64698860] [2022-01-10 20:08:55,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:55,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:55,303 INFO L87 Difference]: Start difference. First operand 136 states and 190 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:08:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,394 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2022-01-10 20:08:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:55,395 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:08:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,397 INFO L225 Difference]: With dead ends: 160 [2022-01-10 20:08:55,397 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 20:08:55,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:08:55,398 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:08:55,399 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:08:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 20:08:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-01-10 20:08:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3888888888888888) internal successors, (200), 144 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:08:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2022-01-10 20:08:55,443 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 34 [2022-01-10 20:08:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,443 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2022-01-10 20:08:55,443 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:08:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2022-01-10 20:08:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 20:08:55,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,445 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:08:55,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:08:55,445 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash 965209184, now seen corresponding path program 1 times [2022-01-10 20:08:55,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12963273] [2022-01-10 20:08:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,519 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:08:55,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12963273] [2022-01-10 20:08:55,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12963273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:55,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436392748] [2022-01-10 20:08:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:55,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:55,521 INFO L87 Difference]: Start difference. First operand 145 states and 200 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:08:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,551 INFO L93 Difference]: Finished difference Result 150 states and 204 transitions. [2022-01-10 20:08:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:08:55,552 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:08:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,553 INFO L225 Difference]: With dead ends: 150 [2022-01-10 20:08:55,553 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 20:08:55,554 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:08:55,555 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:08:55,555 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:08:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 20:08:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-01-10 20:08:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 139 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 191 transitions. [2022-01-10 20:08:55,563 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 191 transitions. Word has length 34 [2022-01-10 20:08:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,563 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 191 transitions. [2022-01-10 20:08:55,564 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:08:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 191 transitions. [2022-01-10 20:08:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 20:08:55,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,565 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:08:55,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:08:55,566 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2002961541, now seen corresponding path program 1 times [2022-01-10 20:08:55,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630414380] [2022-01-10 20:08:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,654 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:08:55,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630414380] [2022-01-10 20:08:55,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630414380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:55,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701757755] [2022-01-10 20:08:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:55,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:55,656 INFO L87 Difference]: Start difference. First operand 140 states and 191 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:08:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,737 INFO L93 Difference]: Finished difference Result 196 states and 255 transitions. [2022-01-10 20:08:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:08:55,738 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:08:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,739 INFO L225 Difference]: With dead ends: 196 [2022-01-10 20:08:55,739 INFO L226 Difference]: Without dead ends: 158 [2022-01-10 20:08:55,739 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:08:55,740 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:55,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 424 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-10 20:08:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-01-10 20:08:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.368421052631579) internal successors, (182), 133 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:08:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2022-01-10 20:08:55,746 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 35 [2022-01-10 20:08:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,747 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2022-01-10 20:08:55,747 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:08:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2022-01-10 20:08:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 20:08:55,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,748 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:08:55,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:08:55,748 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1651682627, now seen corresponding path program 1 times [2022-01-10 20:08:55,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884344159] [2022-01-10 20:08:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,783 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:08:55,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884344159] [2022-01-10 20:08:55,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884344159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:08:55,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74025880] [2022-01-10 20:08:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:08:55,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:08:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:08:55,784 INFO L87 Difference]: Start difference. First operand 134 states and 182 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:08:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:55,826 INFO L93 Difference]: Finished difference Result 192 states and 257 transitions. [2022-01-10 20:08:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:08:55,827 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:08:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:55,827 INFO L225 Difference]: With dead ends: 192 [2022-01-10 20:08:55,827 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 20:08:55,828 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:08:55,829 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:08:55,829 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:08:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 20:08:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-10 20:08:55,832 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:08:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-01-10 20:08:55,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 36 [2022-01-10 20:08:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:55,833 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-01-10 20:08:55,833 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:08:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-01-10 20:08:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 20:08:55,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:55,833 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:08:55,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:08:55,834 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1866800665, now seen corresponding path program 1 times [2022-01-10 20:08:55,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:55,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552819298] [2022-01-10 20:08:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:55,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:55,904 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:08:55,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:55,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552819298] [2022-01-10 20:08:55,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552819298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:55,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:55,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:08:55,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967612582] [2022-01-10 20:08:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:55,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:08:55,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:08:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:08:55,907 INFO L87 Difference]: Start difference. First operand 59 states and 76 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:08:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:56,003 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-01-10 20:08:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:08:56,004 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:08:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:56,005 INFO L225 Difference]: With dead ends: 101 [2022-01-10 20:08:56,005 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 20:08:56,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:08:56,006 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 14 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:56,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 371 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 20:08:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-10 20:08:56,009 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:08:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-01-10 20:08:56,009 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 39 [2022-01-10 20:08:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:56,010 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-01-10 20:08:56,010 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:08:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-01-10 20:08:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 20:08:56,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:56,010 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:08:56,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:08:56,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1106582906, now seen corresponding path program 1 times [2022-01-10 20:08:56,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789903071] [2022-01-10 20:08:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:56,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:56,081 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:08:56,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789903071] [2022-01-10 20:08:56,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789903071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:56,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:56,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:08:56,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469412249] [2022-01-10 20:08:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:56,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:08:56,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:08:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:08:56,083 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:56,227 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-01-10 20:08:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:08:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:56,228 INFO L225 Difference]: With dead ends: 164 [2022-01-10 20:08:56,228 INFO L226 Difference]: Without dead ends: 144 [2022-01-10 20:08:56,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:08:56,229 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 327 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:56,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 336 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-10 20:08:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 74. [2022-01-10 20:08:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:08:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-01-10 20:08:56,235 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 43 [2022-01-10 20:08:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:56,235 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-01-10 20:08:56,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-01-10 20:08:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 20:08:56,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:56,236 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:08:56,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:08:56,237 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1680832581, now seen corresponding path program 1 times [2022-01-10 20:08:56,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:56,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687845779] [2022-01-10 20:08:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:56,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:56,274 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:08:56,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:56,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687845779] [2022-01-10 20:08:56,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687845779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:56,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:56,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:08:56,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825758479] [2022-01-10 20:08:56,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:56,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:08:56,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:08:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:08:56,276 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:08:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:56,290 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-01-10 20:08:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:08:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:08:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:56,291 INFO L225 Difference]: With dead ends: 94 [2022-01-10 20:08:56,291 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 20:08:56,291 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:08:56,292 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 208 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:08:56,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 20:08:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-01-10 20:08:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 58 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:08:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-01-10 20:08:56,296 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 43 [2022-01-10 20:08:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:56,296 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-01-10 20:08:56,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:08:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-01-10 20:08:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 20:08:56,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:56,297 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:08:56,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:08:56,297 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:08:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -455166959, now seen corresponding path program 1 times [2022-01-10 20:08:56,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:56,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355339011] [2022-01-10 20:08:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:56,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:56,366 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:08:56,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:56,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355339011] [2022-01-10 20:08:56,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355339011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:56,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:56,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 20:08:56,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951546000] [2022-01-10 20:08:56,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:56,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 20:08:56,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 20:08:56,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 20:08:56,368 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:56,473 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-01-10 20:08:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:08:56,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:56,474 INFO L225 Difference]: With dead ends: 62 [2022-01-10 20:08:56,474 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 20:08:56,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-01-10 20:08:56,476 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:56,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 238 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:08:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 20:08:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 20:08:56,478 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:08:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 20:08:56,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-01-10 20:08:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:56,478 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 20:08:56,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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:08:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 20:08:56,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 20:08:56,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 20:08:56,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:08:56,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 20:08:56,916 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 20:08:56,916 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 20:08:56,917 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:08:56,917 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:08:56,917 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:08:56,917 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:08:56,917 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: false [2022-01-10 20:08:56,917 INFO L854 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: false [2022-01-10 20:08:56,918 INFO L858 garLoopResultBuilder]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:08:56,918 INFO L854 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: false [2022-01-10 20:08:56,918 INFO L858 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:08:56,918 INFO L858 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,918 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:08:56,918 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:08:56,918 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:08:56,918 INFO L858 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,918 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:08:56,919 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:08:56,919 INFO L854 garLoopResultBuilder]: At program point L57-5(lines 57 72) the Hoare annotation is: false [2022-01-10 20:08:56,919 INFO L858 garLoopResultBuilder]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:08:56,919 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:08:56,919 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:08:56,919 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,919 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:08:56,919 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:08:56,919 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:08:56,919 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,920 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:08:56,920 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:08:56,920 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:08:56,920 INFO L858 garLoopResultBuilder]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2022-01-10 20:08:56,920 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:08:56,920 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:08:56,920 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,920 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:08:56,920 INFO L858 garLoopResultBuilder]: For program point L35-3(lines 35 75) no Hoare annotation was computed. [2022-01-10 20:08:56,921 INFO L858 garLoopResultBuilder]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:08:56,921 INFO L858 garLoopResultBuilder]: For program point L59-2(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,921 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:08:56,921 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:08:56,921 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:08:56,921 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2022-01-10 20:08:56,921 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:08:56,921 INFO L858 garLoopResultBuilder]: For program point L38-3(lines 37 52) no Hoare annotation was computed. [2022-01-10 20:08:56,921 INFO L858 garLoopResultBuilder]: For program point L58-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,921 INFO L858 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2022-01-10 20:08:56,921 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L47-6(lines 47 51) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L59-3(lines 57 72) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2022-01-10 20:08:56,922 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_~sa~0#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|))) [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2022-01-10 20:08:56,922 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_~sa~0#1Int|) (<= 1 |ULTIMATE.start_ULTIMATE.start_main_~tmp~2#1Int|) .cse2) (<= 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~sa~0#1Int|))) [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2022-01-10 20:08:56,922 INFO L858 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L256-2(lines 256 272) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L861 garLoopResultBuilder]: At program point L274(lines 220 276) the Hoare annotation is: true [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 20:08:56,923 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-01-10 20:08:56,924 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 15 20) the Hoare annotation is: true [2022-01-10 20:08:56,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 20:08:56,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 20:08:56,926 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:56,927 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:08:56,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:56 BasicIcfg [2022-01-10 20:08:56,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:08:56,948 INFO L158 Benchmark]: Toolchain (without parser) took 4067.15ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 123.5MB in the beginning and 164.5MB in the end (delta: -40.9MB). Peak memory consumption was 117.8MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,948 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:08:56,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.20ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 123.3MB in the beginning and 222.0MB in the end (delta: -98.7MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.47ms. Allocated memory is still 251.7MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,949 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 251.7MB. Free memory was 219.9MB in the beginning and 217.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,949 INFO L158 Benchmark]: RCFGBuilder took 540.25ms. Allocated memory is still 251.7MB. Free memory was 217.8MB in the beginning and 200.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,949 INFO L158 Benchmark]: IcfgTransformer took 116.18ms. Allocated memory is still 251.7MB. Free memory was 200.5MB in the beginning and 193.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,949 INFO L158 Benchmark]: TraceAbstraction took 3076.22ms. Allocated memory is still 251.7MB. Free memory was 192.7MB in the beginning and 164.5MB in the end (delta: 28.2MB). Peak memory consumption was 114.2MB. Max. memory is 8.0GB. [2022-01-10 20:08:56,951 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.12ms. Allocated memory is still 178.3MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.20ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 123.3MB in the beginning and 222.0MB in the end (delta: -98.7MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.47ms. Allocated memory is still 251.7MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 251.7MB. Free memory was 219.9MB in the beginning and 217.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 540.25ms. Allocated memory is still 251.7MB. Free memory was 217.8MB in the beginning and 200.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 116.18ms. Allocated memory is still 251.7MB. Free memory was 200.5MB in the beginning and 193.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3076.22ms. Allocated memory is still 251.7MB. Free memory was 192.7MB in the beginning and 164.5MB in the end (delta: 28.2MB). Peak memory consumption was 114.2MB. 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.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 960 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 960 mSDsluCounter, 3680 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2656 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 607 IncrementalHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 1024 mSDtfsCounter, 607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 84, 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, 13 MinimizatonAttempts, 221 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 67 NumberOfFragments, 200 HoareAnnotationTreeSize, 24 FomulaSimplifications, 1904 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 1296 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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(0bv32, zero) && ~bvule32(1bv32, sa)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) || ~bvule32(4294967295bv32, sa)) || (((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((~bvule32(0bv32, zero) && ~bvule32(1bv32, sa)) && ~bvule32(1bv32, tmp)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a)) || ((((~bvule32(__retres10, zero) && ~bvule32(0bv32, zero)) && ~bvule32(\result, zero)) && ~bvule32(zero, 0bv32)) && ~bvule32(b, a))) || ~bvule32(4294967295bv32, sa) - 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:08:56,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...