/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_4-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:58,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:58,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:58,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:58,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:58,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:58,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:58,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:58,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:58,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:58,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:58,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:58,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:58,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:58,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:58,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:58,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:58,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:58,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:58,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:58,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:58,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:58,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:58,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:58,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:58,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:58,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:58,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:58,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:58,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:58,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:58,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:58,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:58,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:58,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:58,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:58,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:58,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:58,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:58,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:58,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:58,547 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:58,579 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:58,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:58,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:58,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:58,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:58,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:58,582 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:58,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:58,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:58,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:58,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:58,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:58,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:58,583 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:58,583 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:58,584 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:58,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:58,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:58,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:58,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:58,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:58,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:58,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:58,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:58,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:58,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:58,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:58,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:58,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:58,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:58,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:58,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:58,588 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:58,589 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:58,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:58,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:58,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:58,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:58,835 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:58,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2022-01-10 20:08:58,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10174bc83/5b5798e7d51848f593890cb694683385/FLAG341f54483 [2022-01-10 20:08:59,238 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:59,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2022-01-10 20:08:59,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10174bc83/5b5798e7d51848f593890cb694683385/FLAG341f54483 [2022-01-10 20:08:59,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10174bc83/5b5798e7d51848f593890cb694683385 [2022-01-10 20:08:59,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:59,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:59,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:59,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:59,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:59,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:59" (1/1) ... [2022-01-10 20:08:59,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64923e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:59, skipping insertion in model container [2022-01-10 20:08:59,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:59" (1/1) ... [2022-01-10 20:08:59,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:59,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:59,854 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_4-3a.c.cil.c[730,743] [2022-01-10 20:08:59,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:59,904 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:59,913 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_4-3a.c.cil.c[730,743] [2022-01-10 20:08:59,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:59,946 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:59,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:59 WrapperNode [2022-01-10 20:08:59,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:59,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:59,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:59,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:59,955 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:59" (1/1) ... [2022-01-10 20:08:59,976 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:59" (1/1) ... [2022-01-10 20:09:00,008 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 301 [2022-01-10 20:09:00,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:09:00,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:09:00,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:09:00,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:09:00,020 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:59" (1/1) ... [2022-01-10 20:09:00,021 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:59" (1/1) ... [2022-01-10 20:09:00,039 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:59" (1/1) ... [2022-01-10 20:09:00,039 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:59" (1/1) ... [2022-01-10 20:09:00,045 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:59" (1/1) ... [2022-01-10 20:09:00,050 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:59" (1/1) ... [2022-01-10 20:09:00,066 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:59" (1/1) ... [2022-01-10 20:09:00,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:09:00,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:09:00,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:09:00,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:09:00,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:59" (1/1) ... [2022-01-10 20:09:00,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:09:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:09:00,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:09:00,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:09:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:09:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:09:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:09:00,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:09:00,273 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:09:00,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:09:00,590 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:09:00,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:09:00,597 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 20:09:00,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:00 BoogieIcfgContainer [2022-01-10 20:09:00,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:09:00,599 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:09:00,599 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:09:00,601 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:09:00,603 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:00" (1/1) ... [2022-01-10 20:09:00,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:00 BasicIcfg [2022-01-10 20:09:00,705 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:09:00,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:09:00,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:09:00,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:09:00,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:59" (1/4) ... [2022-01-10 20:09:00,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10533212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:00, skipping insertion in model container [2022-01-10 20:09:00,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:59" (2/4) ... [2022-01-10 20:09:00,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10533212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:09:00, skipping insertion in model container [2022-01-10 20:09:00,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:09:00" (3/4) ... [2022-01-10 20:09:00,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10533212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:00, skipping insertion in model container [2022-01-10 20:09:00,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:09:00" (4/4) ... [2022-01-10 20:09:00,712 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.cTransformedIcfg [2022-01-10 20:09:00,716 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:09:00,716 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-01-10 20:09:00,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:09:00,757 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:09:00,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-10 20:09:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:09:00,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:00,777 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2124957439, now seen corresponding path program 1 times [2022-01-10 20:09:00,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520547438] [2022-01-10 20:09:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:01,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520547438] [2022-01-10 20:09:01,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520547438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:09:01,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504637136] [2022-01-10 20:09:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:09:01,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:09:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:01,110 INFO L87 Difference]: Start difference. First operand has 86 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 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 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,285 INFO L93 Difference]: Finished difference Result 219 states and 323 transitions. [2022-01-10 20:09:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:09:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 20:09:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,308 INFO L225 Difference]: With dead ends: 219 [2022-01-10 20:09:01,308 INFO L226 Difference]: Without dead ends: 135 [2022-01-10 20:09:01,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:01,314 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 242 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 342 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-01-10 20:09:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 85. [2022-01-10 20:09:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 84 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2022-01-10 20:09:01,349 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 15 [2022-01-10 20:09:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,350 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2022-01-10 20:09:01,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-01-10 20:09:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:09:01,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:09:01,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2124927648, now seen corresponding path program 1 times [2022-01-10 20:09:01,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036991645] [2022-01-10 20:09:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:01,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036991645] [2022-01-10 20:09:01,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036991645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:09:01,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870825572] [2022-01-10 20:09:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:09:01,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:09:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:09:01,439 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,517 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2022-01-10 20:09:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:09:01,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 20:09:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,519 INFO L225 Difference]: With dead ends: 184 [2022-01-10 20:09:01,519 INFO L226 Difference]: Without dead ends: 139 [2022-01-10 20:09:01,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:01,521 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 122 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 396 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-01-10 20:09:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-01-10 20:09:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 85 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2022-01-10 20:09:01,531 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 15 [2022-01-10 20:09:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,531 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2022-01-10 20:09:01,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-01-10 20:09:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:01,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:09:01,532 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1591836809, now seen corresponding path program 1 times [2022-01-10 20:09:01,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57512942] [2022-01-10 20:09:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:01,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57512942] [2022-01-10 20:09:01,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57512942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:01,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893302134] [2022-01-10 20:09:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:01,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:01,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:01,605 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,747 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2022-01-10 20:09:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:09:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 20:09:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,749 INFO L225 Difference]: With dead ends: 236 [2022-01-10 20:09:01,749 INFO L226 Difference]: Without dead ends: 210 [2022-01-10 20:09:01,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:09:01,751 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 427 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 419 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-10 20:09:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 118. [2022-01-10 20:09:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 117 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-01-10 20:09:01,766 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 19 [2022-01-10 20:09:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,766 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-01-10 20:09:01,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-01-10 20:09:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:01,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:09:01,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1591866600, now seen corresponding path program 1 times [2022-01-10 20:09:01,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512108769] [2022-01-10 20:09:01,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:01,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512108769] [2022-01-10 20:09:01,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512108769] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:01,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60652958] [2022-01-10 20:09:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:01,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:01,834 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,981 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2022-01-10 20:09:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:09:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 20:09:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,984 INFO L225 Difference]: With dead ends: 225 [2022-01-10 20:09:01,984 INFO L226 Difference]: Without dead ends: 200 [2022-01-10 20:09:01,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 20:09:01,986 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 242 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:01,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 487 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-10 20:09:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 119. [2022-01-10 20:09:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 118 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2022-01-10 20:09:02,006 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 19 [2022-01-10 20:09:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,007 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2022-01-10 20:09:02,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-01-10 20:09:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:02,016 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:09:02,016 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1716453005, now seen corresponding path program 1 times [2022-01-10 20:09:02,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311845116] [2022-01-10 20:09:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:02,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311845116] [2022-01-10 20:09:02,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311845116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:02,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198696273] [2022-01-10 20:09:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:02,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:02,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:02,133 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,316 INFO L93 Difference]: Finished difference Result 214 states and 266 transitions. [2022-01-10 20:09:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:09:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 20:09:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,317 INFO L225 Difference]: With dead ends: 214 [2022-01-10 20:09:02,317 INFO L226 Difference]: Without dead ends: 185 [2022-01-10 20:09:02,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-01-10 20:09:02,319 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 233 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 579 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-10 20:09:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 108. [2022-01-10 20:09:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2022-01-10 20:09:02,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 19 [2022-01-10 20:09:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,328 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2022-01-10 20:09:02,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2022-01-10 20:09:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:02,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:09:02,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1270198582, now seen corresponding path program 1 times [2022-01-10 20:09:02,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804474270] [2022-01-10 20:09:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:02,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804474270] [2022-01-10 20:09:02,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804474270] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:09:02,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517745339] [2022-01-10 20:09:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:09:02,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:09:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:09:02,400 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,628 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2022-01-10 20:09:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:09:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 20:09:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,629 INFO L225 Difference]: With dead ends: 195 [2022-01-10 20:09:02,630 INFO L226 Difference]: Without dead ends: 191 [2022-01-10 20:09:02,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-10 20:09:02,631 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 210 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 892 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-01-10 20:09:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2022-01-10 20:09:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 124 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2022-01-10 20:09:02,642 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 23 [2022-01-10 20:09:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,642 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2022-01-10 20:09:02,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-01-10 20:09:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:02,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:09:02,644 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 336695478, now seen corresponding path program 1 times [2022-01-10 20:09:02,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701855354] [2022-01-10 20:09:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:02,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701855354] [2022-01-10 20:09:02,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701855354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:02,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129236383] [2022-01-10 20:09:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:02,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:02,705 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:02,816 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2022-01-10 20:09:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:09:02,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 20:09:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:02,834 INFO L225 Difference]: With dead ends: 182 [2022-01-10 20:09:02,835 INFO L226 Difference]: Without dead ends: 149 [2022-01-10 20:09:02,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:09:02,836 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:02,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 602 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-01-10 20:09:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2022-01-10 20:09:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 118 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2022-01-10 20:09:02,848 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 23 [2022-01-10 20:09:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:02,848 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2022-01-10 20:09:02,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2022-01-10 20:09:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:02,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:02,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:02,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:09:02,850 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:02,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1323372960, now seen corresponding path program 1 times [2022-01-10 20:09:02,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:02,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62878453] [2022-01-10 20:09:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:02,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:09:02,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:02,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62878453] [2022-01-10 20:09:02,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62878453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:02,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:02,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:02,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328217060] [2022-01-10 20:09:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:02,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:02,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:02,910 INFO L87 Difference]: Start difference. First operand 119 states and 156 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:03,102 INFO L93 Difference]: Finished difference Result 345 states and 433 transitions. [2022-01-10 20:09:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:09:03,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 20:09:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:03,105 INFO L225 Difference]: With dead ends: 345 [2022-01-10 20:09:03,105 INFO L226 Difference]: Without dead ends: 299 [2022-01-10 20:09:03,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-01-10 20:09:03,109 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 582 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:03,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 701 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:09:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-10 20:09:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 133. [2022-01-10 20:09:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 132 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2022-01-10 20:09:03,128 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 23 [2022-01-10 20:09:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:03,133 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2022-01-10 20:09:03,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:09:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2022-01-10 20:09:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:03,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:03,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:09:03,137 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 20:09:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:03,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1323402751, now seen corresponding path program 1 times [2022-01-10 20:09:03,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:03,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497387599] [2022-01-10 20:09:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:03,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:03,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:09:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:03,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:09:03,227 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:09:03,228 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-10 20:09:03,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-10 20:09:03,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-01-10 20:09:03,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-01-10 20:09:03,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-01-10 20:09:03,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-10 20:09:03,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-10 20:09:03,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:09:03,233 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:03,236 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:09:03,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:03 BasicIcfg [2022-01-10 20:09:03,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:09:03,281 INFO L158 Benchmark]: Toolchain (without parser) took 3598.39ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 134.6MB in the beginning and 151.4MB in the end (delta: -16.7MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,281 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 151.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:09:03,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.21ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 157.8MB in the end (delta: -23.3MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.95ms. Allocated memory is still 182.5MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,282 INFO L158 Benchmark]: Boogie Preprocessor took 60.39ms. Allocated memory is still 182.5MB. Free memory was 155.7MB in the beginning and 153.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,282 INFO L158 Benchmark]: RCFGBuilder took 528.17ms. Allocated memory is still 182.5MB. Free memory was 153.6MB in the beginning and 136.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,283 INFO L158 Benchmark]: IcfgTransformer took 105.74ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 129.1MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,283 INFO L158 Benchmark]: TraceAbstraction took 2573.94ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 128.4MB in the beginning and 151.4MB in the end (delta: -22.9MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2022-01-10 20:09:03,285 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.16ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 151.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.21ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 157.8MB in the end (delta: -23.3MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.95ms. Allocated memory is still 182.5MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.39ms. Allocated memory is still 182.5MB. Free memory was 155.7MB in the beginning and 153.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 528.17ms. Allocated memory is still 182.5MB. Free memory was 153.6MB in the beginning and 136.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 105.74ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 129.1MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2573.94ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 128.4MB in the beginning and 151.4MB in the end (delta: -22.9MB). Peak memory consumption was 27.9MB. 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 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of BvToInt. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L242] RET, EXPR base2flt(ma, ea) [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L243] RET, EXPR base2flt(mb, eb) [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 86 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2170 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2170 mSDsluCounter, 4418 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3543 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 875 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=8, InterpolantAutomatonStates: 80, 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, 8 MinimizatonAttempts, 615 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-10 20:09:03,309 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...