/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_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:26:29,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:26:29,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:26:29,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:26:29,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:26:29,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:26:29,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:26:29,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:26:29,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:26:29,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:26:29,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:26:29,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:26:29,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:26:29,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:26:29,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:26:29,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:26:29,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:26:29,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:26:29,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:26:29,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:26:29,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:26:29,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:26:29,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:26:29,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:26:29,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:26:29,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:26:29,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:26:29,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:26:29,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:26:29,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:26:29,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:26:29,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:26:29,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:26:29,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:26:29,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:26:29,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:26:29,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:26:29,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:26:29,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:26:29,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:26:29,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:26:29,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:26:29,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:26:29,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:26:29,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:26:29,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:26:29,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:26:29,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:26:29,551 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:26:29,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:26:29,552 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:26:29,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:26:29,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:26:29,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:26:29,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:26:29,557 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:26:29,557 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:26:29,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:26:29,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:26:29,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:26:29,806 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:26:29,808 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:26:29,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2022-01-11 05:26:29,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d861250b9/b34086cc73754363a4e91faaf2914dc7/FLAG9d7e33b6d [2022-01-11 05:26:30,376 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:26:30,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2022-01-11 05:26:30,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d861250b9/b34086cc73754363a4e91faaf2914dc7/FLAG9d7e33b6d [2022-01-11 05:26:30,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d861250b9/b34086cc73754363a4e91faaf2914dc7 [2022-01-11 05:26:30,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:26:30,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:26:30,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:26:30,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:26:30,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:26:30,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:26:30" (1/1) ... [2022-01-11 05:26:30,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55577791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:30, skipping insertion in model container [2022-01-11 05:26:30,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:26:30" (1/1) ... [2022-01-11 05:26:30,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:26:30,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:26:31,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i[24090,24103] [2022-01-11 05:26:31,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:26:31,182 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:26:31,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i[24090,24103] [2022-01-11 05:26:31,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:26:31,256 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:26:31,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31 WrapperNode [2022-01-11 05:26:31,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:26:31,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:26:31,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:26:31,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:26:31,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,292 INFO L137 Inliner]: procedures = 129, calls = 31, calls flagged for inlining = 6, calls inlined = 5, statements flattened = 82 [2022-01-11 05:26:31,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:26:31,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:26:31,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:26:31,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:26:31,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:26:31,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:26:31,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:26:31,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:26:31,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:26:31,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:31,360 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-11 05:26:31,365 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-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:26:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:26:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:26:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:26:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:26:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:26:31,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:26:31,537 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:26:31,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:26:31,741 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:26:31,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:26:31,746 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 05:26:31,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:31 BoogieIcfgContainer [2022-01-11 05:26:31,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:26:31,748 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:26:31,748 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:26:31,749 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:26:31,751 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:31" (1/1) ... [2022-01-11 05:26:31,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:26:31 BasicIcfg [2022-01-11 05:26:31,840 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:26:31,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:26:31,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:26:31,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:26:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:26:30" (1/4) ... [2022-01-11 05:26:31,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5c23a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:26:31, skipping insertion in model container [2022-01-11 05:26:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:31" (2/4) ... [2022-01-11 05:26:31,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5c23a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:26:31, skipping insertion in model container [2022-01-11 05:26:31,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:31" (3/4) ... [2022-01-11 05:26:31,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5c23a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:26:31, skipping insertion in model container [2022-01-11 05:26:31,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:26:31" (4/4) ... [2022-01-11 05:26:31,852 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.iTransformedIcfg [2022-01-11 05:26:31,856 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:26:31,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:26:31,910 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:26:31,917 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-11 05:26:31,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:26:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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-11 05:26:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:26:31,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:31,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:31,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1308794094, now seen corresponding path program 1 times [2022-01-11 05:26:31,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:31,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329185856] [2022-01-11 05:26:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:31,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:32,139 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-11 05:26:32,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:32,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329185856] [2022-01-11 05:26:32,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329185856] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:32,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:32,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:26:32,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314580710] [2022-01-11 05:26:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:32,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:26:32,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:26:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:26:32,179 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:26:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:32,194 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-01-11 05:26:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:26:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-11 05:26:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:32,203 INFO L225 Difference]: With dead ends: 36 [2022-01-11 05:26:32,204 INFO L226 Difference]: Without dead ends: 18 [2022-01-11 05:26:32,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:26:32,210 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:32,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-11 05:26:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-11 05:26:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-01-11 05:26:32,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2022-01-11 05:26:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:32,241 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-01-11 05:26:32,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:26:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-01-11 05:26:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:26:32,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:32,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:32,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:26:32,244 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2098669521, now seen corresponding path program 1 times [2022-01-11 05:26:32,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:32,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782336099] [2022-01-11 05:26:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:32,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:32,472 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-11 05:26:32,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:32,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782336099] [2022-01-11 05:26:32,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782336099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:32,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:32,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:26:32,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601440374] [2022-01-11 05:26:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:32,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:26:32,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:26:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:26:32,477 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:26:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:32,639 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-01-11 05:26:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:26:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-11 05:26:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:32,642 INFO L225 Difference]: With dead ends: 55 [2022-01-11 05:26:32,642 INFO L226 Difference]: Without dead ends: 37 [2022-01-11 05:26:32,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:26:32,643 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:32,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-11 05:26:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-01-11 05:26:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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-11 05:26:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-11 05:26:32,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2022-01-11 05:26:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:32,649 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-11 05:26:32,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:26:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-11 05:26:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:32,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:32,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:32,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:26:32,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:32,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1704000983, now seen corresponding path program 1 times [2022-01-11 05:26:32,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:32,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542854656] [2022-01-11 05:26:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:32,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:32,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542854656] [2022-01-11 05:26:32,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542854656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:32,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:32,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:26:32,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539443314] [2022-01-11 05:26:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:32,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:26:32,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:32,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:26:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:26:32,753 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 05:26:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:32,771 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-01-11 05:26:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:26:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-11 05:26:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:32,773 INFO L225 Difference]: With dead ends: 35 [2022-01-11 05:26:32,774 INFO L226 Difference]: Without dead ends: 23 [2022-01-11 05:26:32,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:26:32,775 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:32,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-11 05:26:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-11 05:26:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-01-11 05:26:32,779 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-01-11 05:26:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:32,780 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-01-11 05:26:32,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 05:26:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-01-11 05:26:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:32,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:32,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:32,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:26:32,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1709449668, now seen corresponding path program 1 times [2022-01-11 05:26:32,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:32,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503484281] [2022-01-11 05:26:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:32,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:32,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503484281] [2022-01-11 05:26:32,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503484281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:32,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:32,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:26:32,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875284749] [2022-01-11 05:26:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:32,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:26:32,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:26:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:26:32,959 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 05:26:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:32,985 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-01-11 05:26:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:26:32,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-11 05:26:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:32,987 INFO L225 Difference]: With dead ends: 31 [2022-01-11 05:26:32,987 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 05:26:32,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:26:32,997 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:32,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 05:26:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-01-11 05:26:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 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-11 05:26:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-01-11 05:26:33,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-01-11 05:26:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:33,007 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-01-11 05:26:33,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11 05:26:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-01-11 05:26:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:26:33,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:33,009 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-11 05:26:33,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:26:33,010 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1216517790, now seen corresponding path program 1 times [2022-01-11 05:26:33,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:33,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179849763] [2022-01-11 05:26:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:33,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:33,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179849763] [2022-01-11 05:26:33,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179849763] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534945057] [2022-01-11 05:26:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:33,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:33,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:33,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:26:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:33,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:26:33,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:33,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:33,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534945057] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:33,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:33,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-11 05:26:33,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104223288] [2022-01-11 05:26:33,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:33,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:26:33,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:26:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:26:33,714 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:33,741 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-01-11 05:26:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:26:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-11 05:26:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:33,742 INFO L225 Difference]: With dead ends: 41 [2022-01-11 05:26:33,742 INFO L226 Difference]: Without dead ends: 29 [2022-01-11 05:26:33,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:26:33,743 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:33,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-11 05:26:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-01-11 05:26:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-11 05:26:33,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2022-01-11 05:26:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:33,748 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-11 05:26:33,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-11 05:26:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:26:33,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:33,749 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:33,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:33,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:33,975 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1525658392, now seen corresponding path program 1 times [2022-01-11 05:26:33,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:33,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628061028] [2022-01-11 05:26:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:33,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 05:26:34,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:34,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628061028] [2022-01-11 05:26:34,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628061028] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:34,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363592238] [2022-01-11 05:26:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:34,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:34,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:34,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:26:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:34,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-11 05:26:34,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 05:26:34,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 05:26:35,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363592238] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:35,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:35,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2022-01-11 05:26:35,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392739555] [2022-01-11 05:26:35,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:35,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:26:35,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:26:35,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:26:35,139 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-11 05:26:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:35,215 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-01-11 05:26:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:26:35,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-11 05:26:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:35,216 INFO L225 Difference]: With dead ends: 38 [2022-01-11 05:26:35,216 INFO L226 Difference]: Without dead ends: 34 [2022-01-11 05:26:35,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-11 05:26:35,217 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:35,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-01-11 05:26:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-11 05:26:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-01-11 05:26:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-11 05:26:35,223 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2022-01-11 05:26:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:35,223 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-11 05:26:35,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-11 05:26:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-11 05:26:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:26:35,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:35,224 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:35,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:35,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:26:35,431 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 794528910, now seen corresponding path program 2 times [2022-01-11 05:26:35,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:35,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811078530] [2022-01-11 05:26:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:35,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:36,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811078530] [2022-01-11 05:26:36,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811078530] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47735029] [2022-01-11 05:26:36,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:26:36,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:36,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:36,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:36,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:26:37,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:26:37,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:37,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 97 conjunts are in the unsatisfiable core [2022-01-11 05:26:37,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:37,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:26:37,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:37,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-11 05:26:37,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:37,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-11 05:26:37,805 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:26:37,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-11 05:26:37,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:37,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-01-11 05:26:37,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:26:37,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:37,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-01-11 05:26:37,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:26:38,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:38,017 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:26:38,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 83 [2022-01-11 05:26:38,038 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-11 05:26:38,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2022-01-11 05:26:38,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:38,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:38,590 INFO L353 Elim1Store]: treesize reduction 212, result has 13.5 percent of original size [2022-01-11 05:26:38,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 164 treesize of output 105 [2022-01-11 05:26:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,619 INFO L353 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2022-01-11 05:26:38,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 92 [2022-01-11 05:26:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:38,785 INFO L353 Elim1Store]: treesize reduction 73, result has 8.8 percent of original size [2022-01-11 05:26:38,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 251 treesize of output 145 [2022-01-11 05:26:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:38,808 INFO L353 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-01-11 05:26:38,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 96 [2022-01-11 05:26:39,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:39,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:39,180 INFO L353 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-01-11 05:26:39,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 139 treesize of output 69 [2022-01-11 05:26:39,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:39,201 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-01-11 05:26:39,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 33 [2022-01-11 05:26:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:39,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:44,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:44,834 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:44,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3440 treesize of output 2480 [2022-01-11 05:26:44,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:44,892 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:44,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2488 treesize of output 1612 [2022-01-11 05:26:46,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse13 (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse7 (let ((.cse14 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| v_arrayElimArr_4))) (store .cse14 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse14 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse13 v_ArrVal_365))))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse2 (let ((.cse12 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| v_arrayElimArr_3))) (store .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse13 v_ArrVal_367))))) (let ((.cse8 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse9 (mod (+ .cse11 4) 18446744073709551616))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616)) (.cse6 (select (select .cse7 .cse8) .cse9))) (or (let ((.cse3 (mod (+ .cse6 12) 18446744073709551616)) (.cse1 (select (select .cse2 .cse8) .cse9)) (.cse4 (mod (+ .cse6 4) 18446744073709551616))) (and (= (select (select (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 0)))) (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| .cse1))) .cse1) .cse4) 0) (= (select (select (let ((.cse5 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| .cse6))) .cse1) .cse4) 0))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select v_arrayElimArr_3 .cse10))) (not (= (select v_arrayElimArr_4 .cse10) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|)) (not (= .cse11 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse8)) (not (<= 0 .cse6))))))))) is different from false [2022-01-11 05:26:49,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_367 Int) (v_ArrVal_365 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_6| Int)) (let ((.cse12 (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse7 (let ((.cse13 (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_6| v_arrayElimArr_4))) (store .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse12 v_ArrVal_365))))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse2 (let ((.cse11 (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_6| v_arrayElimArr_3))) (store .cse11 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse11 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse12 v_ArrVal_367))))) (let ((.cse8 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse9 (mod (+ .cse10 4) 18446744073709551616))) (let ((.cse6 (select (select .cse7 .cse8) .cse9))) (or (let ((.cse3 (mod (+ 12 .cse6) 18446744073709551616)) (.cse1 (select (select .cse2 .cse8) .cse9)) (.cse4 (mod (+ 4 .cse6) 18446744073709551616))) (and (= (select (select (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 0)))) (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| .cse1))) .cse1) .cse4) 0) (= (select (select (let ((.cse5 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| .cse6))) .cse1) .cse4) 0))) (not (<= 0 .cse10)) (not (<= 0 .cse6)) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_6|) 2) 0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select v_arrayElimArr_3 .cse9))) (not (<= .cse10 0)) (not (= (select v_arrayElimArr_4 .cse9) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|)) (not (= .cse8 |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_6|))))))))) is different from false [2022-01-11 05:26:52,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:53,033 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:53,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 4100 treesize of output 2794 [2022-01-11 05:26:53,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:53,096 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:53,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3012 treesize of output 1706 [2022-01-11 05:26:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver