/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:54:13,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:54:13,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:54:13,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:54:13,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:54:13,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:54:13,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:54:13,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:54:13,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:54:13,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:54:13,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:54:13,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:54:13,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:54:13,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:54:13,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:54:13,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:54:13,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:54:13,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:54:13,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:54:13,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:54:13,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:54:13,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:54:13,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:54:13,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:54:13,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:54:13,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:54:13,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:54:13,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:54:13,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:54:13,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:54:13,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:54:13,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:54:13,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:54:13,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:54:13,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:54:13,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:54:13,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:54:13,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:54:13,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:54:13,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:54:13,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:54:13,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:54:13,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:54:13,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:54:13,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:54:13,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:54:13,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:54:13,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:54:13,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:54:13,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:54:13,467 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:54:13,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:54:13,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:54:13,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:54:13,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:54:13,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:54:13,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:54:13,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:54:13,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:54:13,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:54:13,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:54:13,469 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:54:13,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:54:13,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:54:13,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:54:13,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:54:13,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:54:13,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:54:13,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:54:13,680 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:54:13,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2022-01-10 00:54:13,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8023114ed/4c8517eccba24376816444707b1ebcbf/FLAG752a3e8e9 [2022-01-10 00:54:14,139 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:54:14,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2022-01-10 00:54:14,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8023114ed/4c8517eccba24376816444707b1ebcbf/FLAG752a3e8e9 [2022-01-10 00:54:14,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8023114ed/4c8517eccba24376816444707b1ebcbf [2022-01-10 00:54:14,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:54:14,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:54:14,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:54:14,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:54:14,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:54:14,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1802ea26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14, skipping insertion in model container [2022-01-10 00:54:14,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:54:14,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:54:14,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2022-01-10 00:54:14,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:54:14,799 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:54:14,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i[24989,25002] [2022-01-10 00:54:14,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:54:14,854 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:54:14,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14 WrapperNode [2022-01-10 00:54:14,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:54:14,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:54:14,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:54:14,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:54:14,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,899 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2022-01-10 00:54:14,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:54:14,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:54:14,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:54:14,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:54:14,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:54:14,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:54:14,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:54:14,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:54:14,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (1/1) ... [2022-01-10 00:54:14,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:54:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:14,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:54:14,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:54:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 00:54:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:54:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:54:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:54:15,079 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:54:15,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:54:15,123 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 00:54:15,273 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:54:15,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:54:15,277 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 00:54:15,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:54:15 BoogieIcfgContainer [2022-01-10 00:54:15,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:54:15,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:54:15,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:54:15,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:54:15,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:54:14" (1/3) ... [2022-01-10 00:54:15,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:54:15, skipping insertion in model container [2022-01-10 00:54:15,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:14" (2/3) ... [2022-01-10 00:54:15,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:54:15, skipping insertion in model container [2022-01-10 00:54:15,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:54:15" (3/3) ... [2022-01-10 00:54:15,289 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2022-01-10 00:54:15,293 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:54:15,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:54:15,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:54:15,343 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:54:15,343 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:54:15,361 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) [2022-01-10 00:54:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:54:15,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:15,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:15,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2022-01-10 00:54:15,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:15,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918837793] [2022-01-10 00:54:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:15,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:15,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:15,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918837793] [2022-01-10 00:54:15,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918837793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:15,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:15,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:54:15,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125559091] [2022-01-10 00:54:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:15,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:54:15,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:54:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:54:15,538 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) [2022-01-10 00:54:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:15,553 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2022-01-10 00:54:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:54:15,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 00:54:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:15,564 INFO L225 Difference]: With dead ends: 64 [2022-01-10 00:54:15,564 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 00:54:15,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:54:15,569 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 [2022-01-10 00:54:15,569 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] [2022-01-10 00:54:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 00:54:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 00:54:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-01-10 00:54:15,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2022-01-10 00:54:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:15,591 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-01-10 00:54:15,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-01-10 00:54:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:54:15,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:15,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:15,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:54:15,593 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2022-01-10 00:54:15,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:15,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850875683] [2022-01-10 00:54:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:15,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:15,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850875683] [2022-01-10 00:54:15,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850875683] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:15,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:15,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:54:15,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579446621] [2022-01-10 00:54:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:15,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:54:15,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:15,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:54:15,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:15,666 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:15,677 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-01-10 00:54:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:54:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 00:54:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:15,678 INFO L225 Difference]: With dead ends: 52 [2022-01-10 00:54:15,678 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:54:15,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:15,679 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 [2022-01-10 00:54:15,680 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] [2022-01-10 00:54:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:54:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-01-10 00:54:15,683 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) [2022-01-10 00:54:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-01-10 00:54:15,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2022-01-10 00:54:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:15,683 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-01-10 00:54:15,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-01-10 00:54:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:54:15,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:15,684 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] [2022-01-10 00:54:15,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:54:15,684 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2022-01-10 00:54:15,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:15,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714271527] [2022-01-10 00:54:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:15,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:15,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:15,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714271527] [2022-01-10 00:54:15,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714271527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:15,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:15,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:54:15,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390011901] [2022-01-10 00:54:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:15,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:54:15,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:54:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:15,733 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) [2022-01-10 00:54:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:15,750 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-01-10 00:54:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:54:15,750 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 [2022-01-10 00:54:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:15,752 INFO L225 Difference]: With dead ends: 57 [2022-01-10 00:54:15,752 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:54:15,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:15,757 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 [2022-01-10 00:54:15,758 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] [2022-01-10 00:54:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:54:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-01-10 00:54:15,761 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) [2022-01-10 00:54:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-01-10 00:54:15,761 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2022-01-10 00:54:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:15,761 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-01-10 00:54:15,761 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) [2022-01-10 00:54:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-01-10 00:54:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:54:15,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:15,762 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] [2022-01-10 00:54:15,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:54:15,762 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2022-01-10 00:54:15,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:15,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113866843] [2022-01-10 00:54:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:15,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:15,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113866843] [2022-01-10 00:54:15,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113866843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098738240] [2022-01-10 00:54:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:15,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:15,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:54:15,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:54:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:54:15,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:16,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:16,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098738240] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:16,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:16,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-01-10 00:54:16,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587953940] [2022-01-10 00:54:16,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:16,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:54:16,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:54:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:54:16,075 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) [2022-01-10 00:54:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:16,094 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-01-10 00:54:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:54:16,097 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 [2022-01-10 00:54:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:16,097 INFO L225 Difference]: With dead ends: 53 [2022-01-10 00:54:16,097 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 00:54:16,098 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 [2022-01-10 00:54:16,098 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 [2022-01-10 00:54:16,099 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] [2022-01-10 00:54:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 00:54:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-10 00:54:16,101 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) [2022-01-10 00:54:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-01-10 00:54:16,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-01-10 00:54:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:16,102 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-01-10 00:54:16,102 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) [2022-01-10 00:54:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-01-10 00:54:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:54:16,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:16,102 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] [2022-01-10 00:54:16,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:54:16,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:16,303 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2022-01-10 00:54:16,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349384210] [2022-01-10 00:54:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:16,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:16,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:16,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349384210] [2022-01-10 00:54:16,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349384210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:16,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:16,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:54:16,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516772117] [2022-01-10 00:54:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:16,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:54:16,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:54:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:16,416 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) [2022-01-10 00:54:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:16,446 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-01-10 00:54:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:54:16,447 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 [2022-01-10 00:54:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:16,448 INFO L225 Difference]: With dead ends: 56 [2022-01-10 00:54:16,448 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 00:54:16,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:16,449 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:16,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 00:54:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-01-10 00:54:16,452 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) [2022-01-10 00:54:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-01-10 00:54:16,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2022-01-10 00:54:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:16,452 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-01-10 00:54:16,452 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) [2022-01-10 00:54:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-01-10 00:54:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:54:16,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:16,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:16,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:54:16,453 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2022-01-10 00:54:16,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:16,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101548578] [2022-01-10 00:54:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:16,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:16,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:16,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101548578] [2022-01-10 00:54:16,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101548578] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:16,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042099101] [2022-01-10 00:54:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:16,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:16,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:54:16,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:54:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:54:16,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:16,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:54:16,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042099101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:16,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:54:16,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-01-10 00:54:16,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400442879] [2022-01-10 00:54:16,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:16,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:54:16,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:54:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:54:16,732 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) [2022-01-10 00:54:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:16,744 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-01-10 00:54:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:54:16,745 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 [2022-01-10 00:54:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:16,749 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:54:16,749 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 00:54:16,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:16,754 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 [2022-01-10 00:54:16,754 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] [2022-01-10 00:54:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 00:54:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 00:54:16,762 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) [2022-01-10 00:54:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-01-10 00:54:16,764 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2022-01-10 00:54:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:16,764 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-01-10 00:54:16,764 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) [2022-01-10 00:54:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-01-10 00:54:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:54:16,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:16,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:16,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:54:16,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:54:16,971 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2022-01-10 00:54:16,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:16,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338740267] [2022-01-10 00:54:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:16,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:17,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:17,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338740267] [2022-01-10 00:54:17,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338740267] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:17,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120415994] [2022-01-10 00:54:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:17,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:17,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:54:17,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:54:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:18,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 151 conjunts are in the unsatisfiable core [2022-01-10 00:54:18,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:18,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:54:18,331 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:54:18,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:54:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 00:54:18,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-10 00:54:18,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 00:54:18,559 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:54:18,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-01-10 00:54:18,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 00:54:18,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-10 00:54:18,835 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 00:54:18,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:54:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,005 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 00:54:19,005 INFO L387 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 89 treesize of output 63 [2022-01-10 00:54:19,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:54:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 00:54:19,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:19,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,413 INFO L353 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-01-10 00:54:19,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 137 [2022-01-10 00:54:19,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,432 INFO L353 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-01-10 00:54:19,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 142 [2022-01-10 00:54:19,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-01-10 00:54:19,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,460 INFO L353 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-01-10 00:54:19,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 55 [2022-01-10 00:54:19,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:54:19,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 00:54:19,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:19,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2022-01-10 00:54:19,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,581 INFO L387 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 38 treesize of output 32 [2022-01-10 00:54:19,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:54:19,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:19,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 46 [2022-01-10 00:54:19,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:19,729 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:19,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-01-10 00:54:19,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:54:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:54:19,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:19,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_724) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |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|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |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|))))) is different from false [2022-01-10 00:54:19,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_708 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (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|) .cse0 v_ArrVal_719)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_724) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_711))) (store .cse1 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2 |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|)) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_708))) (store .cse3 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse2 |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|))))) is different from false [2022-01-10 00:54:19,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_708 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse0)) (.cse3 (+ (select .cse6 .cse0) 12))) (select (select (store (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|) .cse0 v_ArrVal_719)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_715) .cse1 v_ArrVal_724) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse4 .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_711))) (store .cse2 .cse1 (store (select .cse2 .cse1) .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|)) (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse6 .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_708))) (store .cse5 .cse1 (store (select .cse5 .cse1) .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|)))))) is different from false [2022-01-10 00:54:20,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_708 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select .cse5 .cse1)) (.cse4 (+ (select .cse7 .cse1) 12))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_719)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_715) .cse2 v_ArrVal_724) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse5 .cse1 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_711))) (store .cse3 .cse2 (store (select .cse3 .cse2) .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|)) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse7 .cse1 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_708))) (store .cse6 .cse2 (store (select .cse6 .cse2) .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|))))))) is different from false [2022-01-10 00:54:20,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_719 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (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|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) 0) (+ 12 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) v_ArrVal_704) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_703)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_699)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse10 (select .cse9 .cse1)) (.cse7 (select .cse6 .cse1)) (.cse2 (+ (select (select .cse9 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse3 (select .cse7 .cse2)) (.cse5 (+ 12 (select .cse10 .cse2)))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_706))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_719))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_715) .cse3 v_ArrVal_724) (select (select (let ((.cse4 (store (store .cse6 .cse1 (store .cse7 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_711))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |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|)) (select (select (let ((.cse8 (store (store .cse9 .cse1 (store .cse10 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_708))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse5 |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|)))))))) is different from false [2022-01-10 00:54:20,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_7| Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_711 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_697)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_695))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_7|) 0)) (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|)) (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_7| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (store .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| (store (store (store (select .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|) 4 0) 12 v_ArrVal_704) 0 v_ArrVal_703)))) (let ((.cse10 (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_699)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select .cse10 .cse2)) (.cse8 (select .cse7 .cse2)) (.cse3 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse8 .cse3)) (.cse6 (+ (select .cse11 .cse3) 12))) (select (select (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_696) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_706))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_719))) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_715) .cse4 v_ArrVal_724) (select (select (let ((.cse5 (store (store .cse7 .cse2 (store .cse8 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_711))) (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 |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|)) (select (select (let ((.cse9 (store (store .cse10 .cse2 (store .cse11 .cse3 0)) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_708))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse6 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-01-10 00:54:20,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:20,878 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:20,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2014 treesize of output 1239 [2022-01-10 00:54:20,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:20,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:20,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:20,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:20,919 INFO L387 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 1207 treesize of output 1200