/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:53:42,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:53:42,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:53:42,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:53:42,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:53:42,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:53:42,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:53:42,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:53:42,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:53:42,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:53:42,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:53:42,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:53:42,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:53:42,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:53:42,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:53:42,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:53:42,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:53:42,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:53:42,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:53:42,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:53:42,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:53:42,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:53:42,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:53:42,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:53:42,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:53:42,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:53:42,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:53:42,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:53:42,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:53:42,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:53:42,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:53:42,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:53:42,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:53:42,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:53:42,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:53:42,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:53:42,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:53:42,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:53:42,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:53:42,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:53:42,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:53:42,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:53:42,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:53:42,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:53:42,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:53:42,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:53:42,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:53:42,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:53:42,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:53:42,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:53:42,942 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:53:42,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:53:42,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:53:42,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:53:42,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:53:42,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:53:42,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:53:42,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:53:42,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:42,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:53:42,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:53:42,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:53:42,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:53:42,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:53:42,946 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:53:42,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:53:42,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:53:42,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 00:53:43,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:53:43,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:53:43,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:53:43,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:53:43,184 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:53:43,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_prepend_equal.i [2022-01-10 00:53:43,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33fe1280/b13faf89172e47b58bc78e23fee172a5/FLAG3c5bcdf18 [2022-01-10 00:53:43,646 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:53:43,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_prepend_equal.i [2022-01-10 00:53:43,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33fe1280/b13faf89172e47b58bc78e23fee172a5/FLAG3c5bcdf18 [2022-01-10 00:53:43,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33fe1280/b13faf89172e47b58bc78e23fee172a5 [2022-01-10 00:53:43,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:53:43,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:53:43,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:43,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:53:44,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:53:44,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:44,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2c6b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44, skipping insertion in model container [2022-01-10 00:53:44,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:44,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:53:44,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:53:44,360 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/dll2c_prepend_equal.i[24640,24653] [2022-01-10 00:53:44,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:44,376 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:53:44,427 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/dll2c_prepend_equal.i[24640,24653] [2022-01-10 00:53:44,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:44,453 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:53:44,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44 WrapperNode [2022-01-10 00:53:44,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:44,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:44,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:53:44,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:53:44,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,524 INFO L137 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2022-01-10 00:53:44,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:44,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:53:44,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:53:44,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:53:44,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:53:44,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:53:44,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:53:44,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:53:44,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (1/1) ... [2022-01-10 00:53:44,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:44,612 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 00:53:44,625 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 00:53:44,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:53:44,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:53:44,651 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 00:53:44,651 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 00:53:44,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:53:44,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:53:44,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:53:44,765 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:53:44,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:53:44,986 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:53:44,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:53:44,992 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 00:53:44,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:44 BoogieIcfgContainer [2022-01-10 00:53:44,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:53:44,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:53:44,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:53:44,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:53:44,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:43" (1/3) ... [2022-01-10 00:53:44,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dfb33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:44, skipping insertion in model container [2022-01-10 00:53:44,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:44" (2/3) ... [2022-01-10 00:53:44,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dfb33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:44, skipping insertion in model container [2022-01-10 00:53:44,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:44" (3/3) ... [2022-01-10 00:53:45,000 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-01-10 00:53:45,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:53:45,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:53:45,042 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:53:45,048 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 00:53:45,048 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:53:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:53:45,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:45,067 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:45,067 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2022-01-10 00:53:45,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:45,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375637140] [2022-01-10 00:53:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:45,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:53:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:53:45,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375637140] [2022-01-10 00:53:45,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375637140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:45,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:45,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:53:45,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623605415] [2022-01-10 00:53:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:45,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:53:45,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:53:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:53:45,321 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:45,419 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-01-10 00:53:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:53:45,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-01-10 00:53:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:45,429 INFO L225 Difference]: With dead ends: 61 [2022-01-10 00:53:45,429 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 00:53:45,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 00:53:45,435 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:45,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 00:53:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 00:53:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-01-10 00:53:45,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2022-01-10 00:53:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:45,471 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-01-10 00:53:45,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-01-10 00:53:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:53:45,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:45,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:45,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:53:45,473 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2022-01-10 00:53:45,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:45,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945747207] [2022-01-10 00:53:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:45,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:53:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:53:45,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:45,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945747207] [2022-01-10 00:53:45,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945747207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:45,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:45,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:53:45,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476047984] [2022-01-10 00:53:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:45,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:53:45,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:53:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:45,631 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:45,715 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-01-10 00:53:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:53:45,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-01-10 00:53:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:45,716 INFO L225 Difference]: With dead ends: 50 [2022-01-10 00:53:45,717 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:53:45,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:45,718 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:45,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:53:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-01-10 00:53:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-01-10 00:53:45,726 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-01-10 00:53:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:45,726 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-01-10 00:53:45,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-01-10 00:53:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 00:53:45,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:45,728 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 00:53:45,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:53:45,728 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2022-01-10 00:53:45,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:45,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050608125] [2022-01-10 00:53:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:45,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:53:46,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:46,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050608125] [2022-01-10 00:53:46,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050608125] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:46,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188445501] [2022-01-10 00:53:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:46,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:46,143 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 00:53:46,178 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 00:53:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-10 00:53:46,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:46,833 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 17 treesize of output 9 [2022-01-10 00:53:46,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:46,955 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 24 treesize of output 24 [2022-01-10 00:53:47,003 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 25 treesize of output 13 [2022-01-10 00:53:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:53:47,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:53:47,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9| Int) (v_ArrVal_452 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9| v_ArrVal_452) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (<= 1 .cse0) (not (< |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0)))) is different from false [2022-01-10 00:53:47,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188445501] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:47,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:53:47,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-01-10 00:53:47,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029491404] [2022-01-10 00:53:47,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:53:47,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 00:53:47,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 00:53:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-01-10 00:53:47,173 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:53:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:47,736 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-01-10 00:53:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 00:53:47,737 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2022-01-10 00:53:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:47,739 INFO L225 Difference]: With dead ends: 37 [2022-01-10 00:53:47,739 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 00:53:47,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=920, Unknown=1, NotChecked=62, Total=1122 [2022-01-10 00:53:47,740 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:47,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2022-01-10 00:53:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 00:53:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-10 00:53:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 00:53:47,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2022-01-10 00:53:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:47,746 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 00:53:47,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:53:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 00:53:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 00:53:47,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:47,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 00:53:47,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:53:47,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:47,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2022-01-10 00:53:47,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199739355] [2022-01-10 00:53:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:47,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:53:48,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:48,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199739355] [2022-01-10 00:53:48,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199739355] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:48,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342151702] [2022-01-10 00:53:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:48,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:48,969 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 00:53:48,975 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 00:53:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:49,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 133 conjunts are in the unsatisfiable core [2022-01-10 00:53:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:49,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:53:49,250 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 5 treesize of output 3 [2022-01-10 00:53:49,368 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:53:49,368 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 00:53:49,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:53:49,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:49,623 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:53:49,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-01-10 00:53:49,918 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 00:53:49,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-10 00:53:49,927 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 8 treesize of output 7 [2022-01-10 00:53:49,939 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 12 treesize of output 11 [2022-01-10 00:53:49,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 00:53:49,995 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 9 treesize of output 7 [2022-01-10 00:53:50,013 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 36 treesize of output 20 [2022-01-10 00:53:50,230 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:53:50,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2022-01-10 00:53:50,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,241 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:53:50,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 00:53:50,246 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 7 treesize of output 3 [2022-01-10 00:53:50,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-01-10 00:53:50,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:53:50,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,494 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:53:50,495 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 50 treesize of output 48 [2022-01-10 00:53:50,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,522 INFO L353 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-01-10 00:53:50,522 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 33 treesize of output 33 [2022-01-10 00:53:50,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,757 INFO L353 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2022-01-10 00:53:50,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 76 [2022-01-10 00:53:50,774 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 0 case distinctions, treesize of input 121 treesize of output 104 [2022-01-10 00:53:50,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,802 INFO L353 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-01-10 00:53:50,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 75 [2022-01-10 00:53:50,813 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:53:50,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 68 [2022-01-10 00:53:50,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,846 INFO L353 Elim1Store]: treesize reduction 70, result has 22.2 percent of original size [2022-01-10 00:53:50,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 107 [2022-01-10 00:53:50,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:50,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 53 [2022-01-10 00:53:50,865 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 50 treesize of output 40 [2022-01-10 00:53:50,965 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 34 treesize of output 22 [2022-01-10 00:53:50,976 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 21 treesize of output 13 [2022-01-10 00:53:51,030 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 19 treesize of output 7 [2022-01-10 00:53:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:53:51,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:53:51,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 Int) (v_ArrVal_940 (Array Int Int)) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 8 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_937))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_951))) .cse2 v_ArrVal_938) .cse3 v_ArrVal_954))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 8) v_ArrVal_955))) (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_946) .cse2 v_ArrVal_940) .cse3 v_ArrVal_936) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 16 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_949) .cse2 v_ArrVal_956) .cse3 v_ArrVal_950) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-01-10 00:53:51,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 Int) (v_ArrVal_940 (Array Int Int)) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_951 Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_937 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ 8 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_937))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_951))) .cse2 v_ArrVal_938) .cse3 v_ArrVal_954))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 8) v_ArrVal_955))) (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_946) .cse2 v_ArrVal_940) .cse3 v_ArrVal_936) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_949) .cse2 v_ArrVal_956) .cse3 v_ArrVal_950) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 16))))))) is different from false [2022-01-10 00:53:51,270 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:53:51,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 279 treesize of output 250 [2022-01-10 00:53:51,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:53:51,372 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 4825660 treesize of output 4777702 [2022-01-10 00:53:53,876 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 5961370 treesize of output 5033626 [2022-01-10 00:53:56,288 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 5320858 treesize of output 5000346 [2022-01-10 00:53:58,506 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 5229002 treesize of output 5141194 [2022-01-10 00:54:05,668 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 8 treesize of output 4 [2022-01-10 00:54:35,073 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:35,074 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 34127 treesize of output 31891