/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_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:54:47,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:54:47,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:54:47,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:54:47,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:54:47,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:54:47,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:54:47,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:54:47,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:54:47,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:54:47,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:54:47,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:54:47,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:54:47,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:54:47,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:54:47,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:54:47,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:54:47,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:54:47,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:54:47,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:54:47,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:54:47,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:54:47,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:54:47,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:54:47,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:54:47,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:54:47,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:54:47,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:54:47,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:54:47,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:54:47,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:54:47,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:54:47,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:54:47,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:54:47,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:54:47,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:54:47,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:54:47,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:54:47,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:54:47,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:54:47,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:54:47,987 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:48,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:54:48,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:54:48,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:54:48,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:54:48,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:54:48,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:54:48,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:54:48,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:54:48,011 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:54:48,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:54:48,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:54:48,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:54:48,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:54:48,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:54:48,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:54:48,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:54:48,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:54:48,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:54:48,031 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:48,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:54:48,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:54:48,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:54:48,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:54:48,351 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:54:48,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2022-01-10 00:54:48,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493b9b6a/e3d37fb1df39421185b03d6c94c36777/FLAGbe20857f6 [2022-01-10 00:54:48,897 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:54:48,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2022-01-10 00:54:48,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493b9b6a/e3d37fb1df39421185b03d6c94c36777/FLAGbe20857f6 [2022-01-10 00:54:49,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2493b9b6a/e3d37fb1df39421185b03d6c94c36777 [2022-01-10 00:54:49,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:54:49,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:54:49,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:54:49,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:54:49,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:54:49,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:54:49" (1/1) ... [2022-01-10 00:54:49,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff41e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:49, skipping insertion in model container [2022-01-10 00:54:49,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:54:49" (1/1) ... [2022-01-10 00:54:49,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:54:49,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:54:49,592 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_remove_all_reverse.i[24275,24288] [2022-01-10 00:54:49,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:54:49,602 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:54:49,636 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_remove_all_reverse.i[24275,24288] [2022-01-10 00:54:49,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:54:49,656 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:54:49,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:49 WrapperNode [2022-01-10 00:54:49,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:54:49,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:54:49,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:54:49,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:54:49,663 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:49" (1/1) ... [2022-01-10 00:54:49,684 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:49" (1/1) ... [2022-01-10 00:54:49,700 INFO L137 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-01-10 00:54:49,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:54:49,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:54:49,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:54:49,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:54:49,706 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:49" (1/1) ... [2022-01-10 00:54:49,706 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:49" (1/1) ... [2022-01-10 00:54:49,714 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:49" (1/1) ... [2022-01-10 00:54:49,714 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:49" (1/1) ... [2022-01-10 00:54:49,727 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:49" (1/1) ... [2022-01-10 00:54:49,729 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:49" (1/1) ... [2022-01-10 00:54:49,730 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:49" (1/1) ... [2022-01-10 00:54:49,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:54:49,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:54:49,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:54:49,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:54:49,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:49" (1/1) ... [2022-01-10 00:54:49,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:54:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:49,788 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:49,800 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:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 00:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:54:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:54:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:54:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:54:49,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:54:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:54:49,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:54:49,937 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:54:49,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:54:49,983 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 00:54:50,138 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:54:50,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:54:50,142 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 00:54:50,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:54:50 BoogieIcfgContainer [2022-01-10 00:54:50,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:54:50,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:54:50,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:54:50,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:54:50,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:54:49" (1/3) ... [2022-01-10 00:54:50,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50516c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:54:50, skipping insertion in model container [2022-01-10 00:54:50,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:54:49" (2/3) ... [2022-01-10 00:54:50,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50516c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:54:50, skipping insertion in model container [2022-01-10 00:54:50,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:54:50" (3/3) ... [2022-01-10 00:54:50,151 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-01-10 00:54:50,154 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:54:50,154 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:54:50,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:54:50,198 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:50,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:54:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 00:54:50,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:50,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:50,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1067882842, now seen corresponding path program 1 times [2022-01-10 00:54:50,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:50,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349117508] [2022-01-10 00:54:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:50,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:50,321 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:50,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349117508] [2022-01-10 00:54:50,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349117508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:50,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:50,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:54:50,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133718462] [2022-01-10 00:54:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:50,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:54:50,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:54:50,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:54:50,350 INFO L87 Difference]: Start difference. First operand has 26 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:50,363 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-01-10 00:54:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:54:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-01-10 00:54:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:50,368 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:54:50,369 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 00:54:50,371 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:50,373 INFO L933 BasicCegarLoop]: 31 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, 31 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:50,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 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:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 00:54:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-10 00:54:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-01-10 00:54:50,395 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2022-01-10 00:54:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:50,395 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-01-10 00:54:50,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-01-10 00:54:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 00:54:50,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:50,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:50,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:54:50,397 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -751387954, now seen corresponding path program 1 times [2022-01-10 00:54:50,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:50,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351665887] [2022-01-10 00:54:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:50,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:50,470 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:50,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:50,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351665887] [2022-01-10 00:54:50,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351665887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:50,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:50,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:54:50,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639580835] [2022-01-10 00:54:50,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:50,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:54:50,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:54:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:50,474 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:50,493 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-01-10 00:54:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:54:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-01-10 00:54:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:50,495 INFO L225 Difference]: With dead ends: 38 [2022-01-10 00:54:50,495 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 00:54:50,497 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:50,498 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 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:50,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 42 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:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 00:54:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-01-10 00:54:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 00:54:50,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2022-01-10 00:54:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:50,502 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 00:54:50,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 00:54:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 00:54:50,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:50,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:50,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:54:50,503 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash -799744514, now seen corresponding path program 1 times [2022-01-10 00:54:50,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:50,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321897956] [2022-01-10 00:54:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:50,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:50,584 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:50,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:50,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321897956] [2022-01-10 00:54:50,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321897956] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:50,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:50,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:54:50,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711644266] [2022-01-10 00:54:50,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:50,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:54:50,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:50,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:54:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:54:50,588 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:50,607 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-01-10 00:54:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:54:50,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-10 00:54:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:50,608 INFO L225 Difference]: With dead ends: 43 [2022-01-10 00:54:50,608 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 00:54:50,609 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:50,612 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 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:50,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 40 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:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 00:54:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 00:54:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 00:54:50,621 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-01-10 00:54:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:50,622 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 00:54:50,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 00:54:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 00:54:50,624 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:50,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:50,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:54:50,624 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -119686144, now seen corresponding path program 1 times [2022-01-10 00:54:50,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:50,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347510800] [2022-01-10 00:54:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:50,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:50,702 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:50,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347510800] [2022-01-10 00:54:50,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347510800] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:50,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547782359] [2022-01-10 00:54:50,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:50,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:50,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:50,706 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:50,707 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:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:50,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:54:50,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:50,813 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:50,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:50,844 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:50,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547782359] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:50,845 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:50,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-01-10 00:54:50,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105594169] [2022-01-10 00:54:50,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:50,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:54:50,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:54:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:54:50,846 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:50,874 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-01-10 00:54:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:54:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 14 [2022-01-10 00:54:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:50,875 INFO L225 Difference]: With dead ends: 39 [2022-01-10 00:54:50,875 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 00:54:50,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:50,876 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 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:50,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 46 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:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 00:54:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 00:54:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-10 00:54:50,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2022-01-10 00:54:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:50,879 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-10 00:54:50,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-10 00:54:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 00:54:50,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:50,880 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:50,900 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:51,091 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:51,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 624479244, now seen corresponding path program 1 times [2022-01-10 00:54:51,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:51,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457147370] [2022-01-10 00:54:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:51,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:51,169 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:51,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:51,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457147370] [2022-01-10 00:54:51,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457147370] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:51,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633343753] [2022-01-10 00:54:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:51,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:51,171 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:51,172 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:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:51,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:54:51,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:51,275 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:51,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:54:51,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633343753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:51,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:54:51,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-01-10 00:54:51,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010426673] [2022-01-10 00:54:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:51,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:54:51,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:51,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:54:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:54:51,278 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:51,291 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-10 00:54:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:54:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19 [2022-01-10 00:54:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:51,292 INFO L225 Difference]: With dead ends: 37 [2022-01-10 00:54:51,292 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 00:54:51,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:51,293 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:51,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 00:54:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-01-10 00:54:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-10 00:54:51,297 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-01-10 00:54:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:51,297 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-10 00:54:51,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-10 00:54:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 00:54:51,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:51,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:51,316 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:51,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:51,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -823741135, now seen corresponding path program 1 times [2022-01-10 00:54:51,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:51,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745857741] [2022-01-10 00:54:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:51,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:51,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:51,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745857741] [2022-01-10 00:54:51,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745857741] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:51,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248476753] [2022-01-10 00:54:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:51,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:51,632 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:51,636 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:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:51,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:54:51,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:51,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:51,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248476753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:51,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:51,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-01-10 00:54:51,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586877715] [2022-01-10 00:54:51,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:51,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:54:51,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:54:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:51,830 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:51,863 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-01-10 00:54:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:54:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 00:54:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:51,864 INFO L225 Difference]: With dead ends: 38 [2022-01-10 00:54:51,864 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 00:54:51,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:54:51,867 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:51,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 00:54:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 00:54:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-10 00:54:51,879 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2022-01-10 00:54:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:51,879 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-10 00:54:51,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-10 00:54:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 00:54:51,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:51,880 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:51,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 00:54:52,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:52,114 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:52,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:52,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1350466602, now seen corresponding path program 2 times [2022-01-10 00:54:52,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:52,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170353738] [2022-01-10 00:54:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:52,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:54:52,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:52,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170353738] [2022-01-10 00:54:52,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170353738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:52,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:52,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:54:52,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852754957] [2022-01-10 00:54:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:52,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:54:52,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:54:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:54:52,181 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:52,231 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-01-10 00:54:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:54:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 00:54:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:52,233 INFO L225 Difference]: With dead ends: 48 [2022-01-10 00:54:52,233 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 00:54:52,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:52,234 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:52,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 00:54:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 00:54:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 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:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-01-10 00:54:52,242 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2022-01-10 00:54:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:52,242 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-01-10 00:54:52,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-01-10 00:54:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 00:54:52,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:52,248 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:52,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:54:52,249 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1124171660, now seen corresponding path program 1 times [2022-01-10 00:54:52,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:52,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859089346] [2022-01-10 00:54:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:52,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:52,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859089346] [2022-01-10 00:54:52,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859089346] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518978290] [2022-01-10 00:54:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:52,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:52,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:54:52,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:54:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:52,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 00:54:52,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:52,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:52,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-01-10 00:54:52,799 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:52,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-01-10 00:54:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 00:54:52,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:54:52,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518978290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:52,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:54:52,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-01-10 00:54:52,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882947229] [2022-01-10 00:54:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:52,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:54:52,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:54:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-01-10 00:54:52,844 INFO L87 Difference]: Start difference. First operand 34 states and 38 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:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:52,860 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-01-10 00:54:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:54:52,860 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 33 [2022-01-10 00:54:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:52,863 INFO L225 Difference]: With dead ends: 53 [2022-01-10 00:54:52,863 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 00:54:52,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-01-10 00:54:52,864 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:52,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-10 00:54:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 00:54:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-10 00:54:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 00:54:52,872 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 33 [2022-01-10 00:54:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:52,872 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 00:54:52,872 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:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 00:54:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:54:52,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:52,873 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:52,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:54:53,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:53,089 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash 441053932, now seen corresponding path program 1 times [2022-01-10 00:54:53,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:53,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471983140] [2022-01-10 00:54:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:53,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:53,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471983140] [2022-01-10 00:54:53,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471983140] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317829993] [2022-01-10 00:54:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:53,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:53,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:54:53,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:54:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:53,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-10 00:54:53,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:53,873 INFO L353 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-01-10 00:54:53,873 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 60 treesize of output 46 [2022-01-10 00:54:53,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:53,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-01-10 00:54:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:54,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:54,272 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:54,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 137 [2022-01-10 00:54:54,564 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:54,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 307 treesize of output 280 [2022-01-10 00:55:11,011 WARN L228 SmtUtils]: Spent 15.48s on a formula simplification. DAG size of input: 50 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 00:55:12,949 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 57 treesize of output 37 [2022-01-10 00:55:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:55:13,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317829993] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:55:13,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:55:13,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2022-01-10 00:55:13,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325723423] [2022-01-10 00:55:13,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:13,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 00:55:13,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 00:55:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 00:55:13,176 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 37 states have internal predecessors, (89), 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:55:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:14,146 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-01-10 00:55:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 00:55:14,146 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 37 states have internal predecessors, (89), 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 37 [2022-01-10 00:55:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:14,147 INFO L225 Difference]: With dead ends: 60 [2022-01-10 00:55:14,147 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 00:55:14,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=413, Invalid=1939, Unknown=0, NotChecked=0, Total=2352 [2022-01-10 00:55:14,148 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 291 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:14,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 100 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 232 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-01-10 00:55:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 00:55:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-10 00:55:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:55:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-10 00:55:14,153 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2022-01-10 00:55:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:14,153 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-10 00:55:14,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 37 states have internal predecessors, (89), 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:55:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-10 00:55:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 00:55:14,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:14,154 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:14,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:14,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:14,355 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1086283439, now seen corresponding path program 2 times [2022-01-10 00:55:14,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:14,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882596466] [2022-01-10 00:55:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:14,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 00:55:14,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:14,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882596466] [2022-01-10 00:55:14,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882596466] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:14,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304578803] [2022-01-10 00:55:14,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:55:14,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:14,841 INFO L229 MonitoredProcess]: Starting monitored process 7 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:55:14,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 00:55:14,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:55:14,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:55:14,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 137 conjunts are in the unsatisfiable core [2022-01-10 00:55:15,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:15,041 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:55:15,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 00:55:15,088 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:55:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 00:55:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 00:55:15,385 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:55:15,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 00:55:15,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 21 [2022-01-10 00:55:15,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:55:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-01-10 00:55:15,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:55:15,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:55:15,587 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:55:15,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 57 [2022-01-10 00:55:15,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-01-10 00:55:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 00:55:16,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:16,393 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base| v_ArrVal_672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-01-10 00:55:16,413 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_last_~last~0#1.base| v_ArrVal_672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~last~0#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-01-10 00:55:16,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~head#1.base|) |c_ULTIMATE.start_dll_remove_last_~head#1.offset|) v_ArrVal_672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~head#1.base|) |c_ULTIMATE.start_dll_remove_last_~head#1.offset|) v_ArrVal_671) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-01-10 00:55:16,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_671) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_672) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-01-10 00:55:16,455 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) .cse0 0)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) .cse0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_672)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4) 0)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_671)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2022-01-10 00:55:16,869 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ 4 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3)) 0)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_671)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (+ 4 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))) (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 0)) (select (select (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_672))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse10) .cse11)) (.cse9 (+ 4 (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11)))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) 0))))) is different from false [2022-01-10 00:55:19,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:55:19,389 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:55:19,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2445 treesize of output 1941 [2022-01-10 00:55:19,414 INFO L353 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-01-10 00:55:19,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1985 treesize of output 1321 [2022-01-10 00:55:22,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse27 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse19 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (.cse22 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse27 v_ArrVal_663))))) (let ((.cse25 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_672 (Array Int Int))) (= (select (select (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse1 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_663)))) (.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse4 .cse5) .cse6)) (.cse3 (+ (select (select .cse1 .cse5) .cse6) 4))) (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 0)) (select (select (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_672))))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (forall ((v_ArrVal_671 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse17 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse13 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse17 v_ArrVal_663)))) (.cse11 (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse14 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (+ (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select (select .cse11 .cse14) .cse15))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (select (select .cse13 .cse14) .cse15) 4) 0)))))))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_671)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (let ((.cse24 (+ .cse25 4))) (let ((.cse20 (select (select .cse19 .cse23) .cse24)) (.cse21 (+ (select (select .cse22 .cse23) .cse24) 4))) (and (= 0 (select (select .cse19 .cse20) .cse21)) (= (select (select .cse22 .cse20) .cse21) 0)))) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_3 .cse0)))))))) is different from false [2022-01-10 00:55:27,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:55:27,948 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:55:27,948 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 3151 treesize of output 2331 [2022-01-10 00:55:27,973 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 00:55:27,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2385 treesize of output 1385 [2022-01-10 00:55:40,049 WARN L228 SmtUtils]: Spent 11.06s on a formula simplification. DAG size of input: 120 DAG size of output: 88 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-10 00:55:40,050 INFO L353 Elim1Store]: treesize reduction 344, result has 59.4 percent of original size [2022-01-10 00:55:40,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 15381445 treesize of output 14131682 [2022-01-10 00:55:50,009 WARN L228 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 9949 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)