/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_LAZY.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:49:21,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:49:21,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:49:21,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:49:21,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:49:21,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:49:21,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:49:21,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:49:21,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:49:21,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:49:21,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:49:21,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:49:21,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:49:21,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:49:21,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:49:21,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:49:21,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:49:21,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:49:21,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:49:21,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:49:21,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:49:21,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:49:21,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:49:21,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:49:21,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:49:21,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:49:21,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:49:21,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:49:21,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:49:21,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:49:21,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:49:21,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:49:21,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:49:21,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:49:21,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:49:21,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:49:21,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:49:21,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:49:21,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:49:21,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:49:21,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:49:21,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:49:21,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:49:21,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:49:21,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:49:21,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:49:21,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:49:21,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:49:21,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:49:21,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:49:21,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:49:21,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:49:21,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:49:21,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:49:21,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:49:21,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:49:21,989 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:49:21,989 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 17:49:22,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:49:22,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:49:22,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:49:22,224 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:49:22,225 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:49:22,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2022-01-10 17:49:22,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35b6e694/61f873ba5b9a4bdb844c62a960433135/FLAGaf92925c7 [2022-01-10 17:49:22,705 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:49:22,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2022-01-10 17:49:22,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35b6e694/61f873ba5b9a4bdb844c62a960433135/FLAGaf92925c7 [2022-01-10 17:49:23,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35b6e694/61f873ba5b9a4bdb844c62a960433135 [2022-01-10 17:49:23,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:49:23,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:49:23,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:49:23,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:49:23,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:49:23,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467d6218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23, skipping insertion in model container [2022-01-10 17:49:23,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:49:23,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:49:23,447 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/sll2c_insert_equal.i[24601,24614] [2022-01-10 17:49:23,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:49:23,460 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:49:23,492 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/sll2c_insert_equal.i[24601,24614] [2022-01-10 17:49:23,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:49:23,516 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:49:23,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23 WrapperNode [2022-01-10 17:49:23,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:49:23,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:49:23,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:49:23,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:49:23,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,567 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 168 [2022-01-10 17:49:23,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:49:23,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:49:23,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:49:23,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:49:23,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:49:23,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:49:23,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:49:23,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:49:23,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (1/1) ... [2022-01-10 17:49:23,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:49:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:23,660 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 17:49:23,682 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 17:49:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:49:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:49:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 17:49:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:49:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:49:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:49:23,831 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:49:23,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:49:24,153 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:49:24,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:49:24,158 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 17:49:24,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:24 BoogieIcfgContainer [2022-01-10 17:49:24,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:49:24,161 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:49:24,161 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:49:24,162 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:49:24,167 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:24" (1/1) ... [2022-01-10 17:49:24,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:49:24 BasicIcfg [2022-01-10 17:49:24,323 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:49:24,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:49:24,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:49:24,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:49:24,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:49:23" (1/4) ... [2022-01-10 17:49:24,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59450e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:49:24, skipping insertion in model container [2022-01-10 17:49:24,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:23" (2/4) ... [2022-01-10 17:49:24,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59450e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:49:24, skipping insertion in model container [2022-01-10 17:49:24,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:24" (3/4) ... [2022-01-10 17:49:24,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59450e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:49:24, skipping insertion in model container [2022-01-10 17:49:24,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:49:24" (4/4) ... [2022-01-10 17:49:24,332 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.iTransformedIcfg [2022-01-10 17:49:24,337 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:49:24,337 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:49:24,379 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:49:24,385 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 17:49:24,385 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:49:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.5) internal successors, (51), 35 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 17:49:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:49:24,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:24,401 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:24,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1980221453, now seen corresponding path program 1 times [2022-01-10 17:49:24,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:24,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605322614] [2022-01-10 17:49:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:24,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:24,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:24,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605322614] [2022-01-10 17:49:24,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605322614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:24,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:24,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:49:24,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36010431] [2022-01-10 17:49:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:24,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:49:24,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:49:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:49:24,642 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.5) internal successors, (51), 35 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17:49:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:24,655 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-01-10 17:49:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:49:24,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2022-01-10 17:49:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:24,662 INFO L225 Difference]: With dead ends: 61 [2022-01-10 17:49:24,662 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 17:49:24,664 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 17:49:24,668 INFO L933 BasicCegarLoop]: 46 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, 46 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 17:49:24,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 17:49:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 17:49:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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 17:49:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 17:49:24,698 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-01-10 17:49:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:24,698 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 17:49:24,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17:49:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 17:49:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:49:24,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:24,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:24,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:49:24,700 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1822509583, now seen corresponding path program 1 times [2022-01-10 17:49:24,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:24,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110500903] [2022-01-10 17:49:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:24,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:24,913 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 17:49:24,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:24,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110500903] [2022-01-10 17:49:24,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110500903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:24,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:24,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:49:24,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885927321] [2022-01-10 17:49:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:24,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:49:24,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:49:24,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:49:24,918 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17:49:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:24,946 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-01-10 17:49:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:49:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 17:49:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:24,948 INFO L225 Difference]: With dead ends: 44 [2022-01-10 17:49:24,948 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 17:49:24,948 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 17:49:24,952 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 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 17:49:24,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 17:49:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-01-10 17:49:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-01-10 17:49:24,959 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2022-01-10 17:49:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:24,959 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-01-10 17:49:24,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17:49:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-01-10 17:49:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:49:24,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:24,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:24,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:49:24,961 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 165083896, now seen corresponding path program 1 times [2022-01-10 17:49:24,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656711593] [2022-01-10 17:49:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:24,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:25,186 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 17:49:25,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656711593] [2022-01-10 17:49:25,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656711593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:25,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:25,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:49:25,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513436366] [2022-01-10 17:49:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:25,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:49:25,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:49:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:49:25,189 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 17:49:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:25,220 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-01-10 17:49:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:49:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 17:49:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:25,221 INFO L225 Difference]: With dead ends: 51 [2022-01-10 17:49:25,221 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 17:49:25,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 17:49:25,229 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:25,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 17:49:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-01-10 17:49:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-01-10 17:49:25,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-01-10 17:49:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:25,241 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-01-10 17:49:25,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 17:49:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-01-10 17:49:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 17:49:25,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:25,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:25,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:49:25,242 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1661759282, now seen corresponding path program 1 times [2022-01-10 17:49:25,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:25,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588476412] [2022-01-10 17:49:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:25,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:26,579 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 17:49:26,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:26,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588476412] [2022-01-10 17:49:26,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588476412] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:26,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952727480] [2022-01-10 17:49:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:26,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:26,583 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 17:49:26,584 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 17:49:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:26,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-10 17:49:26,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:26,956 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:49:26,957 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 17:49:27,202 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:49:27,205 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 17 treesize of output 21 [2022-01-10 17:49:27,370 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 15 treesize of output 11 [2022-01-10 17:49:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:27,485 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 23 treesize of output 22 [2022-01-10 17:49:27,642 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 18 treesize of output 20 [2022-01-10 17:49:27,809 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-10 17:49:27,810 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 20 treesize of output 22 [2022-01-10 17:49:27,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:27,979 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 43 treesize of output 41 [2022-01-10 17:49:27,986 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 26 treesize of output 28 [2022-01-10 17:49:27,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:27,993 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 40 treesize of output 38 [2022-01-10 17:49:28,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:28,375 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 17:49:28,375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 79 [2022-01-10 17:49:28,405 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 17:49:28,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 122 [2022-01-10 17:49:28,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:28,418 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 0 case distinctions, treesize of input 58 treesize of output 56 [2022-01-10 17:49:28,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:28,439 INFO L353 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-01-10 17:49:28,440 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 2 case distinctions, treesize of input 114 treesize of output 109 [2022-01-10 17:49:28,446 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 38 treesize of output 40 [2022-01-10 17:49:28,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:28,565 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:49:28,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 36 [2022-01-10 17:49:28,574 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 37 treesize of output 21 [2022-01-10 17:49:28,634 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 23 treesize of output 7 [2022-01-10 17:49:28,669 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 17:49:28,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:29,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_291 (Array Int Int))) (or (and (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_290 (Array Int Int)) (v_ArrVal_299 Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_292))) (let ((.cse4 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_291)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_290))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_299))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_300) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse5 (select (select (store (store .cse4 .cse1 v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_297) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ 8 (* (div (+ 8 .cse5) 18446744073709551616) (- 18446744073709551616)) .cse5))))))) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_290 (Array Int Int)) (v_ArrVal_299 Int) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_302 (Array Int Int))) (<= (let ((.cse9 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_292))) (let ((.cse10 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_291)) (.cse7 (select (select .cse9 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))) (select (store (let ((.cse6 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_290))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_299))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_300) (select (select (store (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse11 (select (select (store (store .cse10 .cse7 v_ArrVal_302) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_297) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (+ 8 (* (div (+ 8 .cse11) 18446744073709551616) (- 18446744073709551616)) .cse11))))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_291) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|))))) is different from false [2022-01-10 17:49:29,669 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:29,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 18102 treesize of output 17282 [2022-01-10 17:49:29,850 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 1174786 treesize of output 1104890 [2022-01-10 17:49:31,692 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 1104890 treesize of output 1069944 [2022-01-10 17:49:34,556 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 1106748 treesize of output 1062386 [2022-01-10 17:49:35,977 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 1062357 treesize of output 1034709 [2022-01-10 17:49:37,484 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 1034709 treesize of output 1022421 [2022-01-10 17:49:38,894 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 1022421 treesize of output 1008597 [2022-01-10 17:49:40,446 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 1036278 treesize of output 999764 [2022-01-10 17:49:41,976 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 999737 treesize of output 990905 [2022-01-10 17:49:43,505 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 990905 treesize of output 973241 [2022-01-10 17:49:45,194 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 973241 treesize of output 965561 [2022-01-10 17:49:47,318 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 17:49:47,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:49:47,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-01-10 17:49:47,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400469311] [2022-01-10 17:49:47,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:47,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 17:49:47,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:47,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 17:49:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1068, Unknown=21, NotChecked=66, Total=1260 [2022-01-10 17:49:47,320 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 17:49:49,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:49:51,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:49:54,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:49:57,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:49:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:59,660 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-01-10 17:49:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 17:49:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 22 [2022-01-10 17:49:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:59,662 INFO L225 Difference]: With dead ends: 50 [2022-01-10 17:49:59,662 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 17:49:59,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=380, Invalid=2255, Unknown=21, NotChecked=100, Total=2756 [2022-01-10 17:49:59,664 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 249 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 143 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:59,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 52 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 255 Invalid, 4 Unknown, 0 Unchecked, 9.6s Time] [2022-01-10 17:49:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 17:49:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-01-10 17:49:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 17:49:59,672 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 22 [2022-01-10 17:49:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:59,672 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 17:49:59,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 17:49:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 17:49:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:49:59,673 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:59,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:59,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 17:49:59,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:59,883 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash 985043740, now seen corresponding path program 1 times [2022-01-10 17:49:59,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645287688] [2022-01-10 17:49:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:59,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:00,037 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 17:50:00,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:00,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645287688] [2022-01-10 17:50:00,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645287688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:00,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:00,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:50:00,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199306305] [2022-01-10 17:50:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:00,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:50:00,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:50:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:50:00,039 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:00,066 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-01-10 17:50:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:50:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 17:50:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:00,067 INFO L225 Difference]: With dead ends: 44 [2022-01-10 17:50:00,067 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 17:50:00,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:50:00,068 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:00,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 17:50:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-10 17:50:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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 17:50:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-01-10 17:50:00,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 23 [2022-01-10 17:50:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:00,079 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-01-10 17:50:00,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-01-10 17:50:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:50:00,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:00,080 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:00,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:50:00,081 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 803236311, now seen corresponding path program 2 times [2022-01-10 17:50:00,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:00,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395378712] [2022-01-10 17:50:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:00,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:00,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:00,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395378712] [2022-01-10 17:50:00,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395378712] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:00,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155410603] [2022-01-10 17:50:00,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:50:00,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:00,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:00,268 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 17:50:00,269 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 17:50:01,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:50:01,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:50:01,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 127 conjunts are in the unsatisfiable core [2022-01-10 17:50:01,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:01,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:01,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-01-10 17:50:01,445 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:50:01,445 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 17 treesize of output 21 [2022-01-10 17:50:01,576 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 15 treesize of output 11 [2022-01-10 17:50:01,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:01,664 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 23 treesize of output 22 [2022-01-10 17:50:01,674 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 11 treesize of output 7 [2022-01-10 17:50:01,811 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:50:01,811 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 45 treesize of output 42 [2022-01-10 17:50:01,817 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 17:50:01,923 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-01-10 17:50:01,924 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 32 treesize of output 34 [2022-01-10 17:50:02,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:02,115 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:50:02,116 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 87 treesize of output 77 [2022-01-10 17:50:02,124 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 26 treesize of output 28 [2022-01-10 17:50:02,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:02,137 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 93 treesize of output 85 [2022-01-10 17:50:02,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:02,619 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 17:50:02,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 93 [2022-01-10 17:50:02,656 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 17:50:02,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 152 [2022-01-10 17:50:02,682 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 17:50:02,682 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 184 [2022-01-10 17:50:02,705 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 17:50:02,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 213 [2022-01-10 17:50:02,713 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 57 treesize of output 61 [2022-01-10 17:50:02,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:02,838 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-01-10 17:50:02,838 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 58 [2022-01-10 17:50:02,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:02,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2022-01-10 17:50:02,939 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 23 treesize of output 7 [2022-01-10 17:50:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:02,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:03,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_559) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ .cse0 8) 18446744073709551616))) (not (<= 0 .cse0))))) is different from false [2022-01-10 17:50:03,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_559) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ .cse0 8) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|) (not (<= 0 .cse0))))) is different from false [2022-01-10 17:50:03,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse1 (store (select |c_#memory_$Pointer$.offsetInt| .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| .cse1 v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_559) (select (select (store (store |c_#memory_$Pointer$.baseInt| .cse1 (store (select |c_#memory_$Pointer$.baseInt| .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ .cse0 8) 18446744073709551616))))))) is different from false [2022-01-10 17:50:03,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse1 (store (select |c_#memory_$Pointer$.offsetInt| .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| .cse1 v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_559) (select (select (store (store |c_#memory_$Pointer$.baseInt| .cse1 (store (select |c_#memory_$Pointer$.baseInt| .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ .cse0 8) 18446744073709551616))))))) is different from false [2022-01-10 17:50:03,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| Int) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_548)) (.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_549))) (let ((.cse1 (select (select .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)) (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~head#1.offsetInt|)))) (let ((.cse0 (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_547) .cse1 v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_559) (select (select (store (store .cse2 .cse1 (store (select .cse2 .cse1) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ 8 .cse0) 18446744073709551616)))))))) is different from false [2022-01-10 17:50:03,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:03,289 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 28492 treesize of output 27030 [2022-01-10 17:50:03,415 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 30052 treesize of output 28928 [2022-01-10 17:50:03,644 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 28788 treesize of output 28468 [2022-01-10 17:50:03,819 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 17:50:03,819 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:50:03,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-01-10 17:50:03,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038714174] [2022-01-10 17:50:03,819 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:03,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:50:03,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:50:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=460, Unknown=5, NotChecked=230, Total=756 [2022-01-10 17:50:03,821 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:03,902 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-01-10 17:50:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:50:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 17:50:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:03,903 INFO L225 Difference]: With dead ends: 43 [2022-01-10 17:50:03,903 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 17:50:03,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=546, Unknown=5, NotChecked=250, Total=870 [2022-01-10 17:50:03,904 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:03,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 17:50:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 17:50:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-10 17:50:03,922 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2022-01-10 17:50:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:03,922 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-10 17:50:03,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-10 17:50:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:50:03,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:03,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:03,934 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 17:50:04,131 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 17:50:04,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 140635415, now seen corresponding path program 1 times [2022-01-10 17:50:04,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982312206] [2022-01-10 17:50:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:04,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:04,227 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 17:50:04,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982312206] [2022-01-10 17:50:04,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982312206] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091172326] [2022-01-10 17:50:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:04,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:04,229 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 17:50:04,230 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 17:50:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:04,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 17:50:04,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:04,516 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 22 treesize of output 10 [2022-01-10 17:50:04,520 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 22 treesize of output 10 [2022-01-10 17:50:04,546 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 17:50:04,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:04,681 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 17:50:04,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091172326] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:04,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:04,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 17:50:04,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617041132] [2022-01-10 17:50:04,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:04,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 17:50:04,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 17:50:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:50:04,683 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:04,849 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-10 17:50:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:50:04,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:50:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:04,850 INFO L225 Difference]: With dead ends: 47 [2022-01-10 17:50:04,850 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 17:50:04,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:50:04,851 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:04,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:50:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 17:50:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-01-10 17:50:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-10 17:50:04,858 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2022-01-10 17:50:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:04,858 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-10 17:50:04,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-10 17:50:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:50:04,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:04,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:04,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:05,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:05,084 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash 169264566, now seen corresponding path program 1 times [2022-01-10 17:50:05,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:05,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000781888] [2022-01-10 17:50:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:05,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:05,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:05,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000781888] [2022-01-10 17:50:05,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000781888] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:05,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253403315] [2022-01-10 17:50:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:05,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:05,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:05,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:05,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:50:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:05,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 17:50:05,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:05,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:05,641 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 15 treesize of output 17 [2022-01-10 17:50:05,679 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 16 treesize of output 8 [2022-01-10 17:50:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:05,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:50:05,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253403315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:05,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:50:05,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2022-01-10 17:50:05,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139260842] [2022-01-10 17:50:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:05,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:50:05,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:50:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-01-10 17:50:05,707 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 17:50:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:05,935 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-01-10 17:50:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:50:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:50:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:05,937 INFO L225 Difference]: With dead ends: 38 [2022-01-10 17:50:05,937 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:50:05,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-01-10 17:50:05,939 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:05,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 40 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:50:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:50:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 17:50:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-10 17:50:05,952 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2022-01-10 17:50:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:05,952 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-10 17:50:05,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 17:50:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-10 17:50:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:50:05,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:05,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:05,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 17:50:06,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:06,172 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1678868025, now seen corresponding path program 1 times [2022-01-10 17:50:06,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:06,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399455801] [2022-01-10 17:50:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:06,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:06,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399455801] [2022-01-10 17:50:06,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399455801] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911835574] [2022-01-10 17:50:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:06,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:06,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:06,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:50:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:06,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-10 17:50:06,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:06,964 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:50:06,965 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 1 case distinctions, treesize of input 9 treesize of output 11 [2022-01-10 17:50:07,146 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-10 17:50:07,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-10 17:50:07,312 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 11 treesize of output 7 [2022-01-10 17:50:07,411 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:50:07,411 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 17:50:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:07,523 INFO L353 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-01-10 17:50:07,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 37 treesize of output 37 [2022-01-10 17:50:07,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:07,630 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:50:07,630 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 51 treesize of output 49 [2022-01-10 17:50:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:07,636 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 57 treesize of output 53 [2022-01-10 17:50:07,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:07,946 INFO L353 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2022-01-10 17:50:07,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 125 [2022-01-10 17:50:07,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-01-10 17:50:07,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:08,005 INFO L353 Elim1Store]: treesize reduction 53, result has 33.8 percent of original size [2022-01-10 17:50:08,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 111 [2022-01-10 17:50:08,049 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:50:08,049 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 51 treesize of output 49 [2022-01-10 17:50:08,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:08,080 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 17:50:08,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 56 [2022-01-10 17:50:14,177 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 24 treesize of output 20 [2022-01-10 17:50:14,344 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 14 treesize of output 13 [2022-01-10 17:50:17,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:17,096 INFO L353 Elim1Store]: treesize reduction 70, result has 41.7 percent of original size [2022-01-10 17:50:17,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 236 treesize of output 260 [2022-01-10 17:50:17,212 INFO L353 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2022-01-10 17:50:17,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 17:50:17,318 INFO L353 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2022-01-10 17:50:17,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 17:50:17,978 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 17:50:17,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 163 [2022-01-10 17:50:18,236 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 17:50:18,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 185 [2022-01-10 17:50:18,738 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:18,738 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 43 treesize of output 33 [2022-01-10 17:50:18,766 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:18,767 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 34 treesize of output 26 [2022-01-10 17:50:19,316 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:19,316 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 466 treesize of output 468 [2022-01-10 17:50:20,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:20,268 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 17:50:20,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 241 [2022-01-10 17:50:20,282 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:20,282 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 17 treesize of output 11 [2022-01-10 17:50:20,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 17:50:20,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:20,461 INFO L353 Elim1Store]: treesize reduction 20, result has 82.3 percent of original size [2022-01-10 17:50:20,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 207 treesize of output 245 [2022-01-10 17:50:20,509 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 17 treesize of output 11 [2022-01-10 17:50:20,686 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 17 treesize of output 11 [2022-01-10 17:50:21,226 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 17 treesize of output 11 [2022-01-10 17:50:22,373 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 119 treesize of output 95 [2022-01-10 17:50:22,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:22,870 INFO L353 Elim1Store]: treesize reduction 36, result has 36.8 percent of original size [2022-01-10 17:50:22,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 60 [2022-01-10 17:50:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:22,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:23,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| Int) (v_ArrVal_1032 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_1032) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse0 (select (select .cse2 .cse1) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_1026) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))) (or (<= (+ .cse0 1) .cse1) (<= (+ .cse1 1) .cse0)))))) is different from false [2022-01-10 17:50:23,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| Int) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| Int) (v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| Int)) (let ((.cse2 (let ((.cse3 (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|))) (store (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| (store (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_1032) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| (select .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt|)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse1 (select (select .cse2 .cse0) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_1026) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))) (or (<= (+ .cse0 1) .cse1) (<= (+ .cse1 1) .cse0)))))) is different from false [2022-01-10 17:50:23,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| Int) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| Int) (v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| Int)) (let ((.cse2 (let ((.cse3 (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|))) (store (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_1032) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| (select .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt|)))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse0 (select (select .cse2 .cse1) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_1026) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))) (or (<= (+ 1 .cse0) .cse1) (<= (+ .cse1 1) .cse0)))))) is different from false [2022-01-10 17:50:23,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| Int) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| Int) (v_ArrVal_1032 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| Int)) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1024))) (let ((.cse5 (select .cse4 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|))) (store (store .cse4 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store .cse5 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (select (store .cse4 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| v_ArrVal_1032) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt| (select .cse5 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt|))))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse0 (select (select .cse2 .cse1) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1023))) (store .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt| (store (select .cse3 |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~last~1#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offsetInt|))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1026) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)))) (or (<= (+ .cse0 1) .cse1) (<= (+ .cse1 1) .cse0)))))) is different from false [2022-01-10 17:50:23,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:23,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 8643 treesize of output 8617 [2022-01-10 17:50:23,255 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 9635 treesize of output 9603 [2022-01-10 17:50:23,278 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 9603 treesize of output 9539