/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/list-simple/dll2n_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:38:07,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:38:07,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:38:07,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:38:07,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:38:07,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:38:07,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:38:07,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:38:07,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:38:07,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:38:07,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:38:07,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:38:07,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:38:07,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:38:07,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:38:07,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:38:07,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:38:07,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:38:07,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:38:07,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:38:07,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:38:07,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:38:07,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:38:07,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:38:07,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:38:07,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:38:07,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:38:07,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:38:07,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:38:07,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:38:07,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:38:07,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:38:07,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:38:07,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:38:07,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:38:07,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:38:07,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:38:07,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:38:07,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:38:07,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:38:07,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:38:07,927 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 23:38:07,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:38:07,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:38:07,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:38:07,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:38:07,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:38:07,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:38:07,952 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:38:07,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:38:07,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:38:07,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:38:07,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:38:07,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:38:07,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:38:07,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:38:07,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:38:07,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:38:07,955 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:38:07,955 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 23:38:08,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:38:08,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:38:08,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:38:08,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:38:08,238 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:38:08,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2022-01-10 23:38:08,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335e92b8a/0bb93cecf9a64f2d9c31f0eb0ece9863/FLAGbbb58dd24 [2022-01-10 23:38:08,718 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:38:08,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2022-01-10 23:38:08,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335e92b8a/0bb93cecf9a64f2d9c31f0eb0ece9863/FLAGbbb58dd24 [2022-01-10 23:38:08,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335e92b8a/0bb93cecf9a64f2d9c31f0eb0ece9863 [2022-01-10 23:38:08,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:38:08,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:38:08,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:38:08,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:38:08,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:38:08,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:38:08" (1/1) ... [2022-01-10 23:38:08,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297fc01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:08, skipping insertion in model container [2022-01-10 23:38:08,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:38:08" (1/1) ... [2022-01-10 23:38:08,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:38:08,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:38:09,006 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_insert_unequal.i[24989,25002] [2022-01-10 23:38:09,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:38:09,014 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:38:09,040 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_insert_unequal.i[24989,25002] [2022-01-10 23:38:09,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:38:09,057 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:38:09,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09 WrapperNode [2022-01-10 23:38:09,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:38:09,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:38:09,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:38:09,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:38:09,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,098 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2022-01-10 23:38:09,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:38:09,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:38:09,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:38:09,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:38:09,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:38:09,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:38:09,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:38:09,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:38:09,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:38:09,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:09,162 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 23:38:09,169 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 23:38:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:38:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:38:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:38:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:38:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:38:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:38:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:38:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:38:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:38:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:38:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:38:09,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:38:09,263 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:38:09,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:38:09,574 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:38:09,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:38:09,583 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 23:38:09,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:09 BoogieIcfgContainer [2022-01-10 23:38:09,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:38:09,585 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:38:09,585 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:38:09,586 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:38:09,588 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:09" (1/1) ... [2022-01-10 23:38:09,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:38:09 BasicIcfg [2022-01-10 23:38:09,672 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:38:09,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:38:09,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:38:09,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:38:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:38:08" (1/4) ... [2022-01-10 23:38:09,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17551dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:38:09, skipping insertion in model container [2022-01-10 23:38:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:09" (2/4) ... [2022-01-10 23:38:09,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17551dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:38:09, skipping insertion in model container [2022-01-10 23:38:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:09" (3/4) ... [2022-01-10 23:38:09,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17551dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:38:09, skipping insertion in model container [2022-01-10 23:38:09,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:38:09" (4/4) ... [2022-01-10 23:38:09,677 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.iTransformedIcfg [2022-01-10 23:38:09,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:38:09,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:38:09,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:38:09,711 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 23:38:09,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:38:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 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 23:38:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:38:09,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:09,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:09,723 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2135402336, now seen corresponding path program 1 times [2022-01-10 23:38:09,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:09,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563890681] [2022-01-10 23:38:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:09,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:09,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 23:38:09,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:09,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563890681] [2022-01-10 23:38:09,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563890681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:09,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:09,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:38:09,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724684320] [2022-01-10 23:38:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:38:09,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:38:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:38:09,947 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 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 7.5) internal successors, (15), 2 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 23:38:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:09,958 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2022-01-10 23:38:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:38:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 23:38:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:09,964 INFO L225 Difference]: With dead ends: 60 [2022-01-10 23:38:09,964 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 23:38:09,966 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-10 23:38:09,968 INFO L933 BasicCegarLoop]: 47 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, 47 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-10 23:38:09,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 23:38:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 23:38:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 23:38:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-01-10 23:38:09,987 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2022-01-10 23:38:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:09,987 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-01-10 23:38:09,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 23:38:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-01-10 23:38:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:38:09,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:09,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:09,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:38:09,988 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1247898655, now seen corresponding path program 1 times [2022-01-10 23:38:09,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:09,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896292506] [2022-01-10 23:38:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:09,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:10,185 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 23:38:10,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:10,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896292506] [2022-01-10 23:38:10,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896292506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:10,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:10,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:38:10,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464914110] [2022-01-10 23:38:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:10,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:38:10,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:38:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:10,189 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 23:38:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:10,220 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-01-10 23:38:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:38:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 23:38:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:10,222 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:38:10,222 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 23:38:10,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:10,226 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:10,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 23:38:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-01-10 23:38:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 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 23:38:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-01-10 23:38:10,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 15 [2022-01-10 23:38:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:10,243 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-01-10 23:38:10,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 23:38:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-01-10 23:38:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:38:10,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:10,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:10,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:38:10,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash 915411832, now seen corresponding path program 1 times [2022-01-10 23:38:10,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543772781] [2022-01-10 23:38:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:10,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:10,672 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 23:38:10,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:10,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543772781] [2022-01-10 23:38:10,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543772781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:10,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:10,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 23:38:10,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219279221] [2022-01-10 23:38:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:10,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 23:38:10,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 23:38:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:38:10,676 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 23:38:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:11,073 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2022-01-10 23:38:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:38:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-01-10 23:38:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:11,074 INFO L225 Difference]: With dead ends: 83 [2022-01-10 23:38:11,074 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 23:38:11,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 23:38:11,075 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:11,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 150 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:38:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 23:38:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-01-10 23:38:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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 23:38:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-01-10 23:38:11,080 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2022-01-10 23:38:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:11,080 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-01-10 23:38:11,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 23:38:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-01-10 23:38:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:38:11,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:11,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:11,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:38:11,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash 944040983, now seen corresponding path program 1 times [2022-01-10 23:38:11,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:11,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778930948] [2022-01-10 23:38:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:11,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:11,158 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 23:38:11,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778930948] [2022-01-10 23:38:11,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778930948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:11,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:11,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:38:11,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659126978] [2022-01-10 23:38:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:11,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:38:11,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:38:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:11,162 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:38:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:11,171 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-01-10 23:38:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:38:11,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-10 23:38:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:11,173 INFO L225 Difference]: With dead ends: 56 [2022-01-10 23:38:11,173 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 23:38:11,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:11,181 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 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-10 23:38:11,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 23:38:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-10 23:38:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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 23:38:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-01-10 23:38:11,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 16 [2022-01-10 23:38:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:11,189 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-01-10 23:38:11,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:38:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-01-10 23:38:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:38:11,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:11,190 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] [2022-01-10 23:38:11,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:38:11,190 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2111118869, now seen corresponding path program 1 times [2022-01-10 23:38:11,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:11,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985158642] [2022-01-10 23:38:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:11,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:11,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985158642] [2022-01-10 23:38:11,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985158642] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:11,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779106427] [2022-01-10 23:38:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:11,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:11,292 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-10 23:38:11,314 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-10 23:38:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:11,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 23:38:11,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:12,195 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-10 23:38:12,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:38:12,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779106427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:12,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:38:12,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2022-01-10 23:38:12,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764629687] [2022-01-10 23:38:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:12,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:38:12,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:38:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:38:12,196 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10 23:38:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:12,272 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-01-10 23:38:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:38:12,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) Word has length 21 [2022-01-10 23:38:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:12,273 INFO L225 Difference]: With dead ends: 55 [2022-01-10 23:38:12,274 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 23:38:12,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:38:12,275 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:12,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 23:38:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-01-10 23:38:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 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 23:38:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 23:38:12,278 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 21 [2022-01-10 23:38:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:12,278 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 23:38:12,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10 23:38:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 23:38:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:38:12,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:12,279 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] [2022-01-10 23:38:12,318 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-10 23:38:12,479 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-10 23:38:12,480 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1145013510, now seen corresponding path program 1 times [2022-01-10 23:38:12,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:12,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971745445] [2022-01-10 23:38:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:12,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:12,615 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-10 23:38:12,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971745445] [2022-01-10 23:38:12,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971745445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563934040] [2022-01-10 23:38:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:12,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:12,632 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-10 23:38:12,633 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-10 23:38:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:13,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-10 23:38:13,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:13,363 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-10 23:38:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:13,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:13,433 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-10 23:38:13,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:13,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:13,446 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-10 23:38:13,751 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 23:38:13,752 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 20 treesize of output 18 [2022-01-10 23:38:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:13,847 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 23:38:13,848 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 2 case distinctions, treesize of input 105 treesize of output 93 [2022-01-10 23:38:13,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:13,856 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 23:38:13,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2022-01-10 23:38:14,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:14,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:14,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 63 [2022-01-10 23:38:14,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:14,230 INFO L353 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2022-01-10 23:38:14,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 22 [2022-01-10 23:38:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:14,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:14,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| Int)) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_391) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (< |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| 0) (and (forall ((v_ArrVal_390 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_391) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_390) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|)) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616)))) (forall ((v_ArrVal_390 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_391) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_390) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|)) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616)) 0)) (forall ((v_ArrVal_390 (Array Int Int))) (<= (select (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_390))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616)) 0)) (forall ((v_ArrVal_390 (Array Int Int))) (<= 0 (select (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_390))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616))))))) is different from false [2022-01-10 23:38:17,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:17,307 INFO L353 Elim1Store]: treesize reduction 51, result has 54.1 percent of original size [2022-01-10 23:38:17,307 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 336 treesize of output 277 [2022-01-10 23:38:17,370 INFO L353 Elim1Store]: treesize reduction 88, result has 40.5 percent of original size [2022-01-10 23:38:17,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 398 [2022-01-10 23:38:17,535 INFO L353 Elim1Store]: treesize reduction 106, result has 57.6 percent of original size [2022-01-10 23:38:17,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 592 treesize of output 651 [2022-01-10 23:38:17,808 INFO L353 Elim1Store]: treesize reduction 106, result has 57.6 percent of original size [2022-01-10 23:38:17,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 736 treesize of output 819 [2022-01-10 23:38:17,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:17,840 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 819 treesize of output 805 [2022-01-10 23:38:17,914 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:17,923 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 263 treesize of output 259 [2022-01-10 23:38:17,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 243 [2022-01-10 23:38:18,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:18,032 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 247 treesize of output 243 [2022-01-10 23:38:18,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 227 [2022-01-10 23:39:00,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-10 23:39:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:39:00,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563934040] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:39:00,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:39:00,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 21 [2022-01-10 23:39:00,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405965489] [2022-01-10 23:39:00,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:39:00,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 23:39:00,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:39:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 23:39:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2022-01-10 23:39:00,683 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 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 23:39:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:39:00,931 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2022-01-10 23:39:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:39:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 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 21 [2022-01-10 23:39:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:39:00,932 INFO L225 Difference]: With dead ends: 79 [2022-01-10 23:39:00,932 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 23:39:00,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=473, Unknown=1, NotChecked=44, Total=600 [2022-01-10 23:39:00,933 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:39:00,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 453 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2022-01-10 23:39:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 23:39:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-01-10 23:39:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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 23:39:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-01-10 23:39:00,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 21 [2022-01-10 23:39:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:39:00,937 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-01-10 23:39:00,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 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 23:39:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-01-10 23:39:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 23:39:00,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:39:00,937 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, 1, 1] [2022-01-10 23:39:00,957 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-10 23:39:01,147 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-10 23:39:01,148 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:39:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:39:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1847531372, now seen corresponding path program 1 times [2022-01-10 23:39:01,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:39:01,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637281334] [2022-01-10 23:39:01,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:39:01,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:39:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:39:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:39:02,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:39:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637281334] [2022-01-10 23:39:02,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637281334] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:39:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536586004] [2022-01-10 23:39:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:39:02,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:39:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:39:02,404 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-10 23:39:02,405 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-10 23:39:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:39:03,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 115 conjunts are in the unsatisfiable core [2022-01-10 23:39:03,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:39:03,736 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-10 23:39:03,892 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:39:03,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 23:39:04,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10 23:39:04,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 23:39:04,111 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:39:04,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-01-10 23:39:04,116 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 22 treesize of output 24 [2022-01-10 23:39:04,436 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-01-10 23:39:04,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2022-01-10 23:39:04,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,574 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 23:39:04,574 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 2 case distinctions, treesize of input 104 treesize of output 92 [2022-01-10 23:39:04,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 22 treesize of output 24 [2022-01-10 23:39:04,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:04,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 101 treesize of output 93 [2022-01-10 23:39:05,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,014 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:39:05,014 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 99 [2022-01-10 23:39:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,032 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 23:39:05,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 103 [2022-01-10 23:39:05,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-01-10 23:39:05,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2022-01-10 23:39:05,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 23:39:05,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,193 INFO L353 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2022-01-10 23:39:05,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 70 [2022-01-10 23:39:05,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 22 treesize of output 24 [2022-01-10 23:39:05,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 72 treesize of output 59 [2022-01-10 23:39:05,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,330 INFO L353 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2022-01-10 23:39:05,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 43 [2022-01-10 23:39:05,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:39:05,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2022-01-10 23:39:05,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:39:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:39:05,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:39:05,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| Int) (v_ArrVal_591 Int)) (or (not (<= v_ArrVal_591 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.offsetInt|)) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_591)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| v_ArrVal_588) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse0 v_ArrVal_591)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))))) (forall ((v_ArrVal_588 (Array Int Int))) (<= (let ((.cse1 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| v_ArrVal_588) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse1 v_ArrVal_591)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))))) is different from false [2022-01-10 23:39:05,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| Int) (v_ArrVal_591 Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (or (not (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_581))) (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (not (<= v_ArrVal_591 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.offsetInt|)) (and (forall ((v_ArrVal_583 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_579 Int) (v_ArrVal_588 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse3 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616))) (select (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offsetInt| 4) 18446744073709551616))) (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt|) .cse1 v_ArrVal_579)) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_583) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| v_ArrVal_588) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt|) .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_577))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_581))) (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse3 v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))))) (forall ((v_ArrVal_583 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_579 Int) (v_ArrVal_588 (Array Int Int))) (<= (let ((.cse7 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt| 12) 18446744073709551616))) (select (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offsetInt| 4) 18446744073709551616))) (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt|) .cse5 v_ArrVal_579)) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_583) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| v_ArrVal_588) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_577))) (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~snd_to_last~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~new_node~0#1.baseInt| v_ArrVal_581))) (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt| (store (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.baseInt|) .cse7 v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))))) is different from false [2022-01-10 23:39:07,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_7| Int) (v_ArrVal_591 Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_576 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_576))) (let ((.cse0 (select (select .cse25 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (or (not (<= v_ArrVal_591 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (not (<= 0 .cse0)) (and (forall ((v_ArrVal_573 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_579 Int) (v_ArrVal_588 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse7 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_572))) (let ((.cse10 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_576)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (let ((.cse8 (select .cse7 .cse2)) (.cse3 (mod (+ (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|) 4) 18446744073709551616))) (let ((.cse4 (select .cse8 .cse3)) (.cse6 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_7| 12) 18446744073709551616))) (select (select (store (store (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_573))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_579))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_583) .cse4 v_ArrVal_588) (select (select (let ((.cse5 (store (store .cse7 .cse2 (store .cse8 .cse3 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_577))) (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (select (select (let ((.cse9 (store (store .cse10 .cse2 v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_581))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse6 v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))))))) (forall ((v_ArrVal_573 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_579 Int) (v_ArrVal_588 (Array Int Int))) (<= (let ((.cse17 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_572))) (let ((.cse20 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_576)) (.cse12 (select (select .cse17 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (let ((.cse18 (select .cse17 .cse12)) (.cse13 (mod (+ (select (select .cse20 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|) 4) 18446744073709551616))) (let ((.cse14 (select .cse18 .cse13)) (.cse16 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_7| 12) 18446744073709551616))) (select (select (store (store (let ((.cse11 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_573))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_579))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_583) .cse14 v_ArrVal_588) (select (select (let ((.cse15 (store (store .cse17 .cse12 (store .cse18 .cse13 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_577))) (store .cse15 .cse14 (store (select .cse15 .cse14) .cse16 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (select (select (let ((.cse19 (store (store .cse20 .cse12 v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_581))) (store .cse19 .cse14 (store (select .cse19 .cse14) .cse16 v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))) (not (<= 0 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_572))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_insert_~head#1.offsetInt|))) (let ((.cse21 (store (store .cse25 .cse24 v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_581)) (.cse22 (select (select .cse23 .cse24) (mod (+ .cse0 4) 18446744073709551616)))) (store .cse21 .cse22 (store (select .cse21 .cse22) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_insert_~last~0#1.offsetInt_7| 12) 18446744073709551616) v_ArrVal_591))))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))))))) is different from false [2022-01-10 23:39:08,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:39:08,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41734962 treesize of output 41237906 [2022-01-10 23:39:21,527 WARN L228 SmtUtils]: Spent 13.11s on a formula simplification that was a NOOP. DAG size: 2973 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-10 23:39:21,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41899922 treesize of output 39872888