/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-2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:08:57,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:08:57,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:08:57,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:08:57,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:08:57,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:08:57,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:08:57,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:08:57,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:08:57,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:08:57,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:08:57,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:08:57,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:08:57,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:08:57,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:08:57,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:08:57,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:08:57,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:08:57,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:08:57,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:08:57,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:08:57,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:08:57,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:08:57,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:08:57,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:08:57,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:08:57,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:08:57,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:08:57,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:08:57,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:08:57,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:08:57,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:08:57,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:08:57,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:08:57,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:08:57,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:08:57,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:08:57,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:08:57,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:08:57,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:08:57,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:08:57,135 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:57,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:08:57,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:08:57,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:08:57,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:08:57,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:08:57,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:08:57,160 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:08:57,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:08:57,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:08:57,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:08:57,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:08:57,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:57,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:08:57,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:08:57,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:08:57,163 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:08:57,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:08:57,163 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:08:57,163 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:57,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:08:57,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:08:57,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:08:57,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:08:57,328 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:08:57,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_4-2a.c.cil.c [2022-01-10 20:08:57,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea739b1ca/9cd5d4bcc6cd4f4b92b15662ca7e5a7d/FLAG4a57fcf82 [2022-01-10 20:08:57,719 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:08:57,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_4-2a.c.cil.c [2022-01-10 20:08:57,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea739b1ca/9cd5d4bcc6cd4f4b92b15662ca7e5a7d/FLAG4a57fcf82 [2022-01-10 20:08:58,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea739b1ca/9cd5d4bcc6cd4f4b92b15662ca7e5a7d [2022-01-10 20:08:58,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:08:58,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:08:58,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:58,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:08:58,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:08:58,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:58" (1/1) ... [2022-01-10 20:08:58,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4823e851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:58, skipping insertion in model container [2022-01-10 20:08:58,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:08:58" (1/1) ... [2022-01-10 20:08:58,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:08:58,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:08:58,350 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-2a.c.cil.c[755,768] [2022-01-10 20:08:58,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:58,449 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:08:58,460 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-2a.c.cil.c[755,768] [2022-01-10 20:08:58,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:08:58,497 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:08:58,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:58 WrapperNode [2022-01-10 20:08:58,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:08:58,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:58,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:08:58,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:08:58,515 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:58" (1/1) ... [2022-01-10 20:08:58,524 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:58" (1/1) ... [2022-01-10 20:08:58,551 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 291 [2022-01-10 20:08:58,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:08:58,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:08:58,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:08:58,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:08:58,557 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:58" (1/1) ... [2022-01-10 20:08:58,558 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:58" (1/1) ... [2022-01-10 20:08:58,560 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:58" (1/1) ... [2022-01-10 20:08:58,561 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:58" (1/1) ... [2022-01-10 20:08:58,567 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:58" (1/1) ... [2022-01-10 20:08:58,585 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:58" (1/1) ... [2022-01-10 20:08:58,587 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:58" (1/1) ... [2022-01-10 20:08:58,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:08:58,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:08:58,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:08:58,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:08:58,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:58" (1/1) ... [2022-01-10 20:08:58,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:08:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:08:58,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:08:58,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:08:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:08:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:08:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:08:58,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:08:58,706 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:08:58,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:08:58,918 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:08:58,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:08:58,923 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 20:08:58,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:58 BoogieIcfgContainer [2022-01-10 20:08:58,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:08:58,925 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:08:58,925 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:08:58,926 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:08:58,928 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:58" (1/1) ... [2022-01-10 20:08:59,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:59 BasicIcfg [2022-01-10 20:08:59,047 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:08:59,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:08:59,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:08:59,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:08:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:08:58" (1/4) ... [2022-01-10 20:08:59,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc09212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:59, skipping insertion in model container [2022-01-10 20:08:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:08:58" (2/4) ... [2022-01-10 20:08:59,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc09212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:08:59, skipping insertion in model container [2022-01-10 20:08:59,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:08:58" (3/4) ... [2022-01-10 20:08:59,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc09212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:08:59, skipping insertion in model container [2022-01-10 20:08:59,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:08:59" (4/4) ... [2022-01-10 20:08:59,053 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.cTransformedIcfg [2022-01-10 20:08:59,057 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:08:59,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 20:08:59,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:08:59,113 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:08:59,113 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 20:08:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 81 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:08:59,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:59,133 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:08:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 301834233, now seen corresponding path program 1 times [2022-01-10 20:08:59,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235394142] [2022-01-10 20:08:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:59,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235394142] [2022-01-10 20:08:59,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235394142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:59,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937370579] [2022-01-10 20:08:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:59,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:59,418 INFO L87 Difference]: Start difference. First operand has 82 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 81 states have internal predecessors, (130), 0 states have call successors, (0), 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:08:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,548 INFO L93 Difference]: Finished difference Result 207 states and 311 transitions. [2022-01-10 20:08:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:08:59,550 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:08:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,556 INFO L225 Difference]: With dead ends: 207 [2022-01-10 20:08:59,556 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 20:08:59,558 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:08:59,560 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 226 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 330 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:08:59,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 330 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 20:08:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 81. [2022-01-10 20:08:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 80 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2022-01-10 20:08:59,595 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 15 [2022-01-10 20:08:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,595 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2022-01-10 20:08:59,595 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:08:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2022-01-10 20:08:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 20:08:59,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:08:59,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:08:59,597 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:08:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 301864024, now seen corresponding path program 1 times [2022-01-10 20:08:59,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432484990] [2022-01-10 20:08:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:59,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432484990] [2022-01-10 20:08:59,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432484990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:08:59,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264096319] [2022-01-10 20:08:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:08:59,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:08:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:08:59,689 INFO L87 Difference]: Start difference. First operand 81 states and 110 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:08:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:08:59,781 INFO L93 Difference]: Finished difference Result 174 states and 221 transitions. [2022-01-10 20:08:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:08:59,785 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:08:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:08:59,786 INFO L225 Difference]: With dead ends: 174 [2022-01-10 20:08:59,786 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 20:08:59,787 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:08:59,788 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 118 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 380 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:08:59,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 380 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:08:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 20:08:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 82. [2022-01-10 20:08:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 81 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:08:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2022-01-10 20:08:59,796 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 15 [2022-01-10 20:08:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:08:59,796 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2022-01-10 20:08:59,796 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:08:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2022-01-10 20:08:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:08:59,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:08:59,797 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:08:59,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:08:59,797 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:08:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:08:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -876123839, now seen corresponding path program 1 times [2022-01-10 20:08:59,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:08:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229843289] [2022-01-10 20:08:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:08:59,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:08:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:08:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:08:59,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:08:59,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229843289] [2022-01-10 20:08:59,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229843289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:08:59,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:08:59,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:08:59,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086532946] [2022-01-10 20:08:59,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:08:59,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:08:59,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:08:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:08:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:08:59,919 INFO L87 Difference]: Start difference. First operand 82 states and 111 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:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,076 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2022-01-10 20:09:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:09:00,077 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:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,080 INFO L225 Difference]: With dead ends: 222 [2022-01-10 20:09:00,080 INFO L226 Difference]: Without dead ends: 198 [2022-01-10 20:09:00,084 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:00,087 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 401 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 403 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:00,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 403 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:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-10 20:09:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 114. [2022-01-10 20:09:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.4311926605504588) internal successors, (156), 113 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:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2022-01-10 20:09:00,103 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 19 [2022-01-10 20:09:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,106 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2022-01-10 20:09:00,106 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:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2022-01-10 20:09:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:00,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,107 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:00,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:09:00,108 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -876094048, now seen corresponding path program 1 times [2022-01-10 20:09:00,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298310619] [2022-01-10 20:09:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,192 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:00,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298310619] [2022-01-10 20:09:00,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298310619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 20:09:00,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046359886] [2022-01-10 20:09:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 20:09:00,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 20:09:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 20:09:00,195 INFO L87 Difference]: Start difference. First operand 114 states and 156 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:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,301 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-01-10 20:09:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 20:09:00,301 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:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,303 INFO L225 Difference]: With dead ends: 215 [2022-01-10 20:09:00,303 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 20:09:00,303 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:00,317 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 236 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 467 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:00,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 467 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:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 20:09:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 115. [2022-01-10 20:09:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 114 states have internal predecessors, (157), 0 states have call successors, (0), 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,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 157 transitions. [2022-01-10 20:09:00,331 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 157 transitions. Word has length 19 [2022-01-10 20:09:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,331 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 157 transitions. [2022-01-10 20:09:00,331 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:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 157 transitions. [2022-01-10 20:09:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 20:09:00,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,332 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:00,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:09:00,333 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash 110553707, now seen corresponding path program 1 times [2022-01-10 20:09:00,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042496175] [2022-01-10 20:09:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,402 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:00,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042496175] [2022-01-10 20:09:00,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042496175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:00,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452744505] [2022-01-10 20:09:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:00,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:00,405 INFO L87 Difference]: Start difference. First operand 115 states and 157 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:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,539 INFO L93 Difference]: Finished difference Result 206 states and 258 transitions. [2022-01-10 20:09:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:09:00,540 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:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,541 INFO L225 Difference]: With dead ends: 206 [2022-01-10 20:09:00,541 INFO L226 Difference]: Without dead ends: 179 [2022-01-10 20:09:00,541 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:00,541 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 229 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 555 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:00,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 555 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:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-01-10 20:09:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2022-01-10 20:09:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 103 states have internal predecessors, (140), 0 states have call successors, (0), 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,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2022-01-10 20:09:00,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 19 [2022-01-10 20:09:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,549 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2022-01-10 20:09:00,549 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:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2022-01-10 20:09:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:00,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,550 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:00,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:09:00,550 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1920742610, now seen corresponding path program 1 times [2022-01-10 20:09:00,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547782914] [2022-01-10 20:09:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,605 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:00,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547782914] [2022-01-10 20:09:00,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547782914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:09:00,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039849463] [2022-01-10 20:09:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:09:00,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:09:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:09:00,607 INFO L87 Difference]: Start difference. First operand 104 states and 140 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:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,782 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2022-01-10 20:09:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:09:00,782 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:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,783 INFO L225 Difference]: With dead ends: 187 [2022-01-10 20:09:00,783 INFO L226 Difference]: Without dead ends: 183 [2022-01-10 20:09:00,784 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:00,784 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 202 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 852 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:00,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 852 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:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-10 20:09:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 121. [2022-01-10 20:09:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 120 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:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2022-01-10 20:09:00,792 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 23 [2022-01-10 20:09:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,792 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2022-01-10 20:09:00,792 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:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2022-01-10 20:09:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:00,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,793 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:00,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:09:00,793 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1499888494, now seen corresponding path program 1 times [2022-01-10 20:09:00,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146145813] [2022-01-10 20:09:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:00,840 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:00,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:00,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146145813] [2022-01-10 20:09:00,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146145813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:00,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:00,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:00,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057323008] [2022-01-10 20:09:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:00,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:00,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:00,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:00,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:00,841 INFO L87 Difference]: Start difference. First operand 121 states and 161 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:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:00,926 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2022-01-10 20:09:00,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:09:00,926 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:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:00,927 INFO L225 Difference]: With dead ends: 176 [2022-01-10 20:09:00,927 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 20:09:00,927 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:00,928 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 578 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:09:00,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 578 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:09:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 20:09:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2022-01-10 20:09:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 114 states have internal predecessors, (152), 0 states have call successors, (0), 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,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 152 transitions. [2022-01-10 20:09:00,935 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 152 transitions. Word has length 23 [2022-01-10 20:09:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:00,935 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 152 transitions. [2022-01-10 20:09:00,935 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:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 152 transitions. [2022-01-10 20:09:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:00,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:00,936 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:00,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:09:00,936 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1808401256, now seen corresponding path program 1 times [2022-01-10 20:09:00,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387196952] [2022-01-10 20:09:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:00,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:09:01,006 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,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:09:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387196952] [2022-01-10 20:09:01,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387196952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:09:01,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:09:01,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:09:01,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486338626] [2022-01-10 20:09:01,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:09:01,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:09:01,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:09:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:09:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:09:01,007 INFO L87 Difference]: Start difference. First operand 115 states and 152 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:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:09:01,151 INFO L93 Difference]: Finished difference Result 325 states and 413 transitions. [2022-01-10 20:09:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 20:09:01,151 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:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:09:01,152 INFO L225 Difference]: With dead ends: 325 [2022-01-10 20:09:01,153 INFO L226 Difference]: Without dead ends: 283 [2022-01-10 20:09:01,153 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:01,153 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 534 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 681 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:01,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 681 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:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-10 20:09:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 129. [2022-01-10 20:09:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 128 states have internal predecessors, (172), 0 states have call successors, (0), 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,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2022-01-10 20:09:01,161 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 23 [2022-01-10 20:09:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:09:01,161 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2022-01-10 20:09:01,161 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:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2022-01-10 20:09:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:09:01,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:09:01,162 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:01,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:09:01,162 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 20:09:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:09:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1808371465, now seen corresponding path program 1 times [2022-01-10 20:09:01,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:09:01,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917341864] [2022-01-10 20:09:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:09:01,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:09:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:01,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:09:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:09:01,212 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:09:01,212 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:09:01,212 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-10 20:09:01,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-10 20:09:01,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-01-10 20:09:01,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-01-10 20:09:01,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-10 20:09:01,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:09:01,216 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:09:01,217 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:09:01,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:09:01 BasicIcfg [2022-01-10 20:09:01,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:09:01,251 INFO L158 Benchmark]: Toolchain (without parser) took 3083.04ms. Allocated memory was 203.4MB in the beginning and 366.0MB in the end (delta: 162.5MB). Free memory was 148.8MB in the beginning and 286.3MB in the end (delta: -137.5MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,251 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:09:01,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.72ms. Allocated memory was 203.4MB in the beginning and 366.0MB in the end (delta: 162.5MB). Free memory was 148.6MB in the beginning and 336.9MB in the end (delta: -188.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 366.0MB. Free memory was 336.9MB in the beginning and 334.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,251 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 366.0MB. Free memory was 334.3MB in the beginning and 332.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,251 INFO L158 Benchmark]: RCFGBuilder took 333.65ms. Allocated memory is still 366.0MB. Free memory was 332.7MB in the beginning and 314.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,252 INFO L158 Benchmark]: IcfgTransformer took 122.54ms. Allocated memory is still 366.0MB. Free memory was 314.3MB in the beginning and 307.0MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,252 INFO L158 Benchmark]: TraceAbstraction took 2201.85ms. Allocated memory is still 366.0MB. Free memory was 306.5MB in the beginning and 286.3MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-01-10 20:09:01,253 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.09ms. Allocated memory is still 203.4MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.72ms. Allocated memory was 203.4MB in the beginning and 366.0MB in the end (delta: 162.5MB). Free memory was 148.6MB in the beginning and 336.9MB in the end (delta: -188.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 366.0MB. Free memory was 336.9MB in the beginning and 334.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 366.0MB. Free memory was 334.3MB in the beginning and 332.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.65ms. Allocated memory is still 366.0MB. Free memory was 332.7MB in the beginning and 314.3MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 122.54ms. Allocated memory is still 366.0MB. Free memory was 314.3MB in the beginning and 307.0MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 2201.85ms. Allocated memory is still 366.0MB. Free memory was 306.5MB in the beginning and 286.3MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: 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: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; [L242] CALL, EXPR base2flt(0, 0) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L242] RET, EXPR base2flt(0, 0) [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L243] RET, EXPR base2flt(ma, ea) [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L244] RET, EXPR base2flt(mb, eb) [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 18]: 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: 18]: 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: 18]: 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: 18]: 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, 82 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2058 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2058 mSDsluCounter, 4246 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3405 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 841 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred 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, 579 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s 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:01,272 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...