./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:41:50,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:41:50,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:41:50,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:41:50,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:41:50,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:41:50,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:41:50,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:41:50,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:41:50,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:41:50,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:41:50,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:41:50,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:41:50,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:41:50,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:41:50,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:41:50,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:41:50,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:41:50,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:41:50,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:41:50,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:41:50,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:41:50,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:41:50,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:41:50,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:41:50,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:41:50,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:41:50,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:41:50,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:41:50,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:41:50,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:41:50,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:41:50,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:41:50,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:41:50,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:41:50,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:41:50,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:41:50,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:41:50,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:41:50,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:41:50,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:41:50,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:41:50,981 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:41:50,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:41:50,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:41:50,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:41:50,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:41:50,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:41:50,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:41:50,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:41:50,985 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:41:50,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:41:50,986 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:41:50,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:41:50,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:41:50,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:41:50,987 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:41:50,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:41:50,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:41:50,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:41:50,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:41:50,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:41:50,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:41:50,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:41:50,990 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:41:50,991 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2021-12-14 13:41:51,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:41:51,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:41:51,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:41:51,300 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:41:51,300 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:41:51,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2021-12-14 13:41:51,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e09ad1c/e27a2be8cbb547e1a5250aab807cc029/FLAG796c9eb6c [2021-12-14 13:41:51,759 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:41:51,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2021-12-14 13:41:51,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e09ad1c/e27a2be8cbb547e1a5250aab807cc029/FLAG796c9eb6c [2021-12-14 13:41:51,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e09ad1c/e27a2be8cbb547e1a5250aab807cc029 [2021-12-14 13:41:51,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:41:51,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:41:51,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:41:51,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:41:51,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:41:51,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:41:51" (1/1) ... [2021-12-14 13:41:51,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40993ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:51, skipping insertion in model container [2021-12-14 13:41:51,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:41:51" (1/1) ... [2021-12-14 13:41:51,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:41:51,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:41:52,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2021-12-14 13:41:52,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:41:52,125 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:41:52,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2021-12-14 13:41:52,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:41:52,196 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:41:52,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52 WrapperNode [2021-12-14 13:41:52,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:41:52,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:41:52,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:41:52,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:41:52,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,245 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2021-12-14 13:41:52,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:41:52,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:41:52,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:41:52,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:41:52,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:41:52,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:41:52,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:41:52,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:41:52,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (1/1) ... [2021-12-14 13:41:52,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:41:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:52,313 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) [2021-12-14 13:41:52,327 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 [2021-12-14 13:41:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 13:41:52,343 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 13:41:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:41:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:41:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:41:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:41:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:41:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:41:52,423 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:41:52,424 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:41:52,455 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 13:41:52,636 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:41:52,640 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:41:52,640 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 13:41:52,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:41:52 BoogieIcfgContainer [2021-12-14 13:41:52,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:41:52,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:41:52,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:41:52,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:41:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:41:51" (1/3) ... [2021-12-14 13:41:52,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a7ce55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:41:52, skipping insertion in model container [2021-12-14 13:41:52,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:41:52" (2/3) ... [2021-12-14 13:41:52,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a7ce55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:41:52, skipping insertion in model container [2021-12-14 13:41:52,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:41:52" (3/3) ... [2021-12-14 13:41:52,647 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2021-12-14 13:41:52,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:41:52,663 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:41:52,709 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:41:52,726 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 [2021-12-14 13:41:52,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:41:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:41:52,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:52,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:52,749 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2021-12-14 13:41:52,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:52,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237790639] [2021-12-14 13:41:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:52,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:52,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237790639] [2021-12-14 13:41:52,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237790639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:52,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:52,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:41:52,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619367053] [2021-12-14 13:41:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:52,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:41:52,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:41:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:41:52,927 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:52,941 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2021-12-14 13:41:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:41:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 13:41:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:52,947 INFO L225 Difference]: With dead ends: 64 [2021-12-14 13:41:52,947 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:41:52,950 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 [2021-12-14 13:41:52,952 INFO L933 BasicCegarLoop]: 49 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, 49 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 [2021-12-14 13:41:52,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:41:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 13:41:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2021-12-14 13:41:52,975 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2021-12-14 13:41:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:52,975 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-14 13:41:52,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-12-14 13:41:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:41:52,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:52,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:52,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:41:52,978 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2021-12-14 13:41:52,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:52,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722199340] [2021-12-14 13:41:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:52,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:53,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:53,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722199340] [2021-12-14 13:41:53,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722199340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:53,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:53,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:41:53,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330359896] [2021-12-14 13:41:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:53,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:41:53,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:41:53,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:41:53,046 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:53,055 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-12-14 13:41:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:41:53,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 13:41:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:53,056 INFO L225 Difference]: With dead ends: 52 [2021-12-14 13:41:53,056 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 13:41:53,056 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 [2021-12-14 13:41:53,057 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:53,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 13:41:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-14 13:41:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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) [2021-12-14 13:41:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-12-14 13:41:53,066 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2021-12-14 13:41:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:53,067 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-12-14 13:41:53,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-12-14 13:41:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:41:53,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:53,077 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] [2021-12-14 13:41:53,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:41:53,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2021-12-14 13:41:53,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:53,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317980974] [2021-12-14 13:41:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:53,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:53,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317980974] [2021-12-14 13:41:53,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317980974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:53,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:53,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:41:53,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965667149] [2021-12-14 13:41:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:53,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:41:53,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:41:53,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:41:53,143 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-12-14 13:41:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:53,163 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2021-12-14 13:41:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:41:53,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2021-12-14 13:41:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:53,164 INFO L225 Difference]: With dead ends: 57 [2021-12-14 13:41:53,164 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 13:41:53,164 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 [2021-12-14 13:41:53,165 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 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 [2021-12-14 13:41:53,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 13:41:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-12-14 13:41:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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) [2021-12-14 13:41:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2021-12-14 13:41:53,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2021-12-14 13:41:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:53,170 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2021-12-14 13:41:53,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-12-14 13:41:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-12-14 13:41:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:41:53,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:53,171 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] [2021-12-14 13:41:53,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:41:53,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2021-12-14 13:41:53,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:53,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744067168] [2021-12-14 13:41:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:53,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:53,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744067168] [2021-12-14 13:41:53,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744067168] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:53,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134405174] [2021-12-14 13:41:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:53,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:53,224 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) [2021-12-14 13:41:53,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:41:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:41:53,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:53,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:41:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:53,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134405174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:41:53,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:41:53,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-14 13:41:53,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68101283] [2021-12-14 13:41:53,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:41:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:41:53,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:41:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:41:53,415 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:53,426 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2021-12-14 13:41:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:41:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 13:41:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:53,427 INFO L225 Difference]: With dead ends: 53 [2021-12-14 13:41:53,427 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 13:41:53,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:41:53,429 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:53,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 13:41:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-14 13:41:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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) [2021-12-14 13:41:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-12-14 13:41:53,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2021-12-14 13:41:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-14 13:41:53,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-12-14 13:41:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:41:53,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:53,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:53,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:41:53,651 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 [2021-12-14 13:41:53,651 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2021-12-14 13:41:53,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:53,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442382270] [2021-12-14 13:41:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:41:53,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:53,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442382270] [2021-12-14 13:41:53,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442382270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:53,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:53,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:41:53,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591777808] [2021-12-14 13:41:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:53,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:41:53,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:41:53,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:41:53,767 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:53,782 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2021-12-14 13:41:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:41:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:41:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:53,784 INFO L225 Difference]: With dead ends: 56 [2021-12-14 13:41:53,784 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 13:41:53,784 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 [2021-12-14 13:41:53,785 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:53,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 13:41:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2021-12-14 13:41:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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) [2021-12-14 13:41:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-14 13:41:53,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2021-12-14 13:41:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:53,792 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-14 13:41:53,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-12-14 13:41:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:41:53,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:53,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:53,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:41:53,795 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2021-12-14 13:41:53,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753444082] [2021-12-14 13:41:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:41:53,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:53,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753444082] [2021-12-14 13:41:53,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753444082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:53,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:53,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:41:53,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253196992] [2021-12-14 13:41:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:53,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:41:53,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:41:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:41:53,855 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2021-12-14 13:41:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:53,865 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-12-14 13:41:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:41:53,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 26 [2021-12-14 13:41:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:53,866 INFO L225 Difference]: With dead ends: 47 [2021-12-14 13:41:53,866 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:41:53,867 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 [2021-12-14 13:41:53,867 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 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 [2021-12-14 13:41:53,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:41:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-14 13:41:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:41:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-12-14 13:41:53,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2021-12-14 13:41:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:53,871 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-14 13:41:53,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2021-12-14 13:41:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-12-14 13:41:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:41:53,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:53,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:53,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:41:53,873 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2021-12-14 13:41:53,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499985628] [2021-12-14 13:41:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:53,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:54,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:54,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499985628] [2021-12-14 13:41:54,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499985628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:54,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770239059] [2021-12-14 13:41:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:54,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:54,560 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) [2021-12-14 13:41:54,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:41:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:54,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 134 conjunts are in the unsatisfiable core [2021-12-14 13:41:54,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:54,980 INFO L388 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 [2021-12-14 13:41:55,039 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:41:55,040 INFO L388 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 [2021-12-14 13:41:55,231 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-14 13:41:55,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-14 13:41:55,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 13:41:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:41:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:41:55,458 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:41:55,459 INFO L388 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 68 treesize of output 63 [2021-12-14 13:41:55,465 INFO L388 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 31 treesize of output 31 [2021-12-14 13:41:55,469 INFO L388 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 20 treesize of output 22 [2021-12-14 13:41:55,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,752 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-14 13:41:55,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-14 13:41:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,904 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:41:55,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 80 [2021-12-14 13:41:55,923 INFO L388 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 18 treesize of output 20 [2021-12-14 13:41:55,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:55,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 13:41:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:56,281 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-14 13:41:56,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 146 [2021-12-14 13:41:56,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:56,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-14 13:41:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:56,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2021-12-14 13:41:56,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:56,317 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2021-12-14 13:41:56,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2021-12-14 13:41:56,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:56,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:56,326 INFO L388 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:41:56,434 INFO L388 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 47 treesize of output 34 [2021-12-14 13:41:56,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2021-12-14 13:41:56,456 INFO L388 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 19 treesize of output 18 [2021-12-14 13:41:56,573 INFO L388 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2021-12-14 13:41:56,578 INFO L388 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 22 treesize of output 10 [2021-12-14 13:41:56,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 [2021-12-14 13:41:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:41:56,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:41:56,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_648 Int) (v_ArrVal_632 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (let ((.cse1 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_634) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_636))) (store .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_632))) (store .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (= .cse0 0) (= .cse1 0)) (= (select (select (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) v_ArrVal_642)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_638))) (store .cse2 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 v_ArrVal_648))) .cse1) .cse0) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2021-12-14 13:41:56,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_648 Int) (v_ArrVal_632 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5)) (.cse4 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5)))) (let ((.cse0 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_634) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_636))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_632))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (= .cse0 0) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5 v_ArrVal_642)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_638))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_648))) .cse0) .cse1))))))) is different from false [2021-12-14 13:41:57,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_648 Int) (v_ArrVal_632 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 8))) (let ((.cse1 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_634) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_636))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 |c_ULTIMATE.start_node_create_#res#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_637) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_632))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (= .cse0 0) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse2 (store (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_ArrVal_642)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_638))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_648))) .cse1) .cse0))))))) is different from false [2021-12-14 13:41:57,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_630 Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_626 Int) (v_ArrVal_648 Int) (v_ArrVal_632 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_624)) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4) 0) (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 8) v_ArrVal_630) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_626)))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse7 (+ (select (select .cse9 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse11 .cse6) .cse7)) (.cse4 (+ (select (select .cse9 .cse6) .cse7) 8))) (let ((.cse0 (select (select (let ((.cse10 (store (store .cse11 .cse6 v_ArrVal_634) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_636))) (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (let ((.cse8 (store (store .cse9 .cse6 v_ArrVal_637) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_632))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (= .cse0 0) (= .cse1 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse2 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_628))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_642))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_638))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_648))) .cse0) .cse1)))))))) is different from false [2021-12-14 13:41:59,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_7| Int) (v_ArrVal_626 Int) (v_ArrVal_648 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_623 (Array Int Int)) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_630 Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_624 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_621)) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_622))) (let ((.cse11 (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_624)) (.cse13 (store .cse9 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| (store (store (store (select .cse9 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|) 4 0) 8 v_ArrVal_630) 0 v_ArrVal_626)))) (let ((.cse7 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse13 .cse7) .cse8)) (.cse5 (+ (select (select .cse11 .cse7) .cse8) 8))) (let ((.cse1 (select (select (let ((.cse12 (store (store .cse13 .cse7 v_ArrVal_634) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_636))) (store .cse12 .cse4 (store (select .cse12 .cse4) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (let ((.cse10 (store (store .cse11 .cse7 v_ArrVal_637) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_632))) (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (and (= .cse1 0) (= .cse2 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_7|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_~temp~0#1.base_7|) (= (select (select (let ((.cse3 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_623) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_628))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_642))) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_638))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_648))) .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2021-12-14 13:41:59,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:59,940 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:59,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3139 treesize of output 1914 [2021-12-14 13:41:59,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:59,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:59,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:42:00,012 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:42:00,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1193 treesize of output 1150