./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 23:20:06,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 23:20:06,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 23:20:06,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 23:20:06,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 23:20:06,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 23:20:06,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 23:20:06,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 23:20:06,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 23:20:06,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 23:20:06,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 23:20:06,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 23:20:06,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 23:20:06,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 23:20:06,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 23:20:06,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 23:20:06,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 23:20:06,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 23:20:06,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 23:20:06,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 23:20:06,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 23:20:06,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 23:20:06,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 23:20:06,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 23:20:06,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 23:20:06,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 23:20:06,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 23:20:06,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 23:20:06,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 23:20:06,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 23:20:06,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 23:20:06,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 23:20:06,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 23:20:06,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 23:20:06,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 23:20:06,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 23:20:06,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 23:20:06,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 23:20:06,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 23:20:06,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 23:20:06,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 23:20:06,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 23:20:06,924 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 23:20:06,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 23:20:06,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 23:20:06,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 23:20:06,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 23:20:06,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 23:20:06,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 23:20:06,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 23:20:06,927 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 23:20:06,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 23:20:06,928 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 23:20:06,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 23:20:06,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 23:20:06,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 23:20:06,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 23:20:06,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 23:20:06,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 23:20:06,929 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 23:20:06,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 23:20:06,930 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 23:20:06,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 23:20:06,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 23:20:06,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 23:20:06,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 23:20:06,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:20:06,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 23:20:06,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 23:20:06,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 23:20:06,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 23:20:06,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 23:20:06,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 23:20:06,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 23:20:06,932 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 23:20:06,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 23:20:06,933 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 23:20:06,933 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2023-02-17 23:20:07,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 23:20:07,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 23:20:07,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 23:20:07,142 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 23:20:07,145 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 23:20:07,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-02-17 23:20:08,255 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 23:20:08,446 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 23:20:08,447 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-02-17 23:20:08,458 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c369d496e/17249e9851da4c64970cd740151e04f3/FLAG8bb4282cb [2023-02-17 23:20:08,474 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c369d496e/17249e9851da4c64970cd740151e04f3 [2023-02-17 23:20:08,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 23:20:08,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 23:20:08,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 23:20:08,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 23:20:08,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 23:20:08,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd1ae7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08, skipping insertion in model container [2023-02-17 23:20:08,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 23:20:08,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 23:20:08,740 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-02-17 23:20:08,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:20:08,758 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 23:20:08,818 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-02-17 23:20:08,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:20:08,844 INFO L208 MainTranslator]: Completed translation [2023-02-17 23:20:08,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08 WrapperNode [2023-02-17 23:20:08,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 23:20:08,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 23:20:08,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 23:20:08,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 23:20:08,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,905 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2023-02-17 23:20:08,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 23:20:08,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 23:20:08,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 23:20:08,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 23:20:08,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 23:20:08,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 23:20:08,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 23:20:08,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 23:20:08,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (1/1) ... [2023-02-17 23:20:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:20:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:20:08,966 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) [2023-02-17 23:20:08,967 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 [2023-02-17 23:20:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-17 23:20:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-17 23:20:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 23:20:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 23:20:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 23:20:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 23:20:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 23:20:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 23:20:09,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 23:20:09,177 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 23:20:09,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 23:20:09,223 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-17 23:20:09,428 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 23:20:09,433 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 23:20:09,440 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 23:20:09,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:20:09 BoogieIcfgContainer [2023-02-17 23:20:09,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 23:20:09,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 23:20:09,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 23:20:09,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 23:20:09,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 11:20:08" (1/3) ... [2023-02-17 23:20:09,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21749de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:20:09, skipping insertion in model container [2023-02-17 23:20:09,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:20:08" (2/3) ... [2023-02-17 23:20:09,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21749de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:20:09, skipping insertion in model container [2023-02-17 23:20:09,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:20:09" (3/3) ... [2023-02-17 23:20:09,451 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2023-02-17 23:20:09,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 23:20:09,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 23:20:09,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 23:20:09,525 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70e662cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 23:20:09,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 23:20:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 23:20:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 23:20:09,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:09,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:09,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -670387442, now seen corresponding path program 1 times [2023-02-17 23:20:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:09,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189785800] [2023-02-17 23:20:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189785800] [2023-02-17 23:20:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189785800] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:20:09,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:20:09,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 23:20:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990239543] [2023-02-17 23:20:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:20:09,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 23:20:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 23:20:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 23:20:09,862 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-02-17 23:20:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:09,884 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2023-02-17 23:20:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 23:20:09,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2023-02-17 23:20:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:09,892 INFO L225 Difference]: With dead ends: 52 [2023-02-17 23:20:09,892 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 23:20:09,895 INFO L412 NwaCegarLoop]: 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 [2023-02-17 23:20:09,901 INFO L413 NwaCegarLoop]: 38 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, 38 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 [2023-02-17 23:20:09,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:20:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 23:20:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 23:20:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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) [2023-02-17 23:20:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-02-17 23:20:09,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-02-17 23:20:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:09,930 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-02-17 23:20:09,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-02-17 23:20:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-02-17 23:20:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 23:20:09,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:09,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 23:20:09,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash -888049989, now seen corresponding path program 1 times [2023-02-17 23:20:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:09,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142096536] [2023-02-17 23:20:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:10,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142096536] [2023-02-17 23:20:10,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142096536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:20:10,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:20:10,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 23:20:10,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427637401] [2023-02-17 23:20:10,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:20:10,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 23:20:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 23:20:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 23:20:10,144 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-17 23:20:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:10,160 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-02-17 23:20:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 23:20:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2023-02-17 23:20:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:10,163 INFO L225 Difference]: With dead ends: 40 [2023-02-17 23:20:10,164 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 23:20:10,171 INFO L412 NwaCegarLoop]: 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 [2023-02-17 23:20:10,174 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 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 [2023-02-17 23:20:10,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:20:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 23:20:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2023-02-17 23:20:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2023-02-17 23:20:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-02-17 23:20:10,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2023-02-17 23:20:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-17 23:20:10,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-17 23:20:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-02-17 23:20:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 23:20:10,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:10,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:10,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 23:20:10,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash -116753941, now seen corresponding path program 1 times [2023-02-17 23:20:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:10,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729698766] [2023-02-17 23:20:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:10,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729698766] [2023-02-17 23:20:10,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729698766] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:20:10,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:20:10,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 23:20:10,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364753403] [2023-02-17 23:20:10,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:20:10,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 23:20:10,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:10,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 23:20:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 23:20:10,287 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 23:20:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:10,307 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2023-02-17 23:20:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 23:20:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 23:20:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:10,308 INFO L225 Difference]: With dead ends: 45 [2023-02-17 23:20:10,308 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 23:20:10,309 INFO L412 NwaCegarLoop]: 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 [2023-02-17 23:20:10,310 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 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 [2023-02-17 23:20:10,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:20:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 23:20:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-17 23:20:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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) [2023-02-17 23:20:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-17 23:20:10,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-02-17 23:20:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:10,314 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-17 23:20:10,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 23:20:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-17 23:20:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 23:20:10,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:10,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 23:20:10,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -703559955, now seen corresponding path program 1 times [2023-02-17 23:20:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142092793] [2023-02-17 23:20:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142092793] [2023-02-17 23:20:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142092793] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:20:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853312790] [2023-02-17 23:20:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:10,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:20:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:20:10,471 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) [2023-02-17 23:20:10,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 23:20:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:10,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 23:20:10,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:20:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:10,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:20:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:10,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853312790] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 23:20:10,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 23:20:10,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-17 23:20:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428991364] [2023-02-17 23:20:10,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 23:20:10,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 23:20:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 23:20:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-17 23:20:10,713 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) [2023-02-17 23:20:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:10,732 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-02-17 23:20:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 23:20:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 23:20:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:10,734 INFO L225 Difference]: With dead ends: 41 [2023-02-17 23:20:10,734 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 23:20:10,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-17 23:20:10,735 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 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 [2023-02-17 23:20:10,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:20:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 23:20:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 23:20:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 23:20:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-02-17 23:20:10,739 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2023-02-17 23:20:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:10,740 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-02-17 23:20:10,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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) [2023-02-17 23:20:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-02-17 23:20:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 23:20:10,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:10,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:10,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 23:20:10,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:20:10,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1057796345, now seen corresponding path program 1 times [2023-02-17 23:20:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:10,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195520730] [2023-02-17 23:20:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 23:20:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:11,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195520730] [2023-02-17 23:20:11,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195520730] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:20:11,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:20:11,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 23:20:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113597210] [2023-02-17 23:20:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:20:11,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 23:20:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 23:20:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-02-17 23:20:11,850 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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) [2023-02-17 23:20:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:12,063 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-17 23:20:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 23:20:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-17 23:20:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:12,065 INFO L225 Difference]: With dead ends: 30 [2023-02-17 23:20:12,065 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 23:20:12,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-02-17 23:20:12,066 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 23:20:12,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 46 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 23:20:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 23:20:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-17 23:20:12,070 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) [2023-02-17 23:20:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-17 23:20:12,071 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2023-02-17 23:20:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:12,071 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-17 23:20:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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) [2023-02-17 23:20:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-17 23:20:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 23:20:12,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:12,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 23:20:12,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1364928246, now seen corresponding path program 1 times [2023-02-17 23:20:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81816120] [2023-02-17 23:20:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 23:20:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:12,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81816120] [2023-02-17 23:20:12,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81816120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:20:12,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:20:12,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-17 23:20:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645478706] [2023-02-17 23:20:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:20:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 23:20:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:20:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 23:20:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-02-17 23:20:12,847 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2023-02-17 23:20:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:20:13,086 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2023-02-17 23:20:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 23:20:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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 25 [2023-02-17 23:20:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:20:13,088 INFO L225 Difference]: With dead ends: 51 [2023-02-17 23:20:13,088 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 23:20:13,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2023-02-17 23:20:13,089 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 23:20:13,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 54 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 23:20:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 23:20:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-02-17 23:20:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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) [2023-02-17 23:20:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-17 23:20:13,095 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2023-02-17 23:20:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:20:13,095 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-17 23:20:13,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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) [2023-02-17 23:20:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-17 23:20:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 23:20:13,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:20:13,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:20:13,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 23:20:13,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:20:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:20:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1364926572, now seen corresponding path program 1 times [2023-02-17 23:20:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:20:13,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847296447] [2023-02-17 23:20:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:20:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:20:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847296447] [2023-02-17 23:20:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847296447] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:20:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954940705] [2023-02-17 23:20:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:20:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:20:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:20:14,097 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) [2023-02-17 23:20:14,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 23:20:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:20:14,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-17 23:20:14,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:20:14,282 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 23:20:14,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:14,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 23:20:14,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:14,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 89 [2023-02-17 23:20:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-17 23:20:14,502 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 23:20:14,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:14,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 102 treesize of output 170 [2023-02-17 23:20:14,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,843 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 23:20:14,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,850 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 32 [2023-02-17 23:20:14,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 23:20:14,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,911 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2023-02-17 23:20:14,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 23:20:14,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,937 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-17 23:20:14,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:14,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:14,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 114 [2023-02-17 23:20:14,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 23:20:14,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2023-02-17 23:20:15,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-02-17 23:20:15,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-02-17 23:20:15,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 70 [2023-02-17 23:20:15,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,090 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 23 [2023-02-17 23:20:15,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,098 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 39 [2023-02-17 23:20:15,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-17 23:20:15,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:15,202 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 73 [2023-02-17 23:20:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:20:15,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2023-02-17 23:20:15,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 23:20:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 23:20:15,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:20:15,395 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2023-02-17 23:20:15,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_564))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2023-02-17 23:20:15,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2023-02-17 23:20:15,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_553 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_564))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 8 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))))) is different from false [2023-02-17 23:20:15,586 INFO L350 Elim1Store]: Elim1 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 31382 treesize of output 29732 [2023-02-17 23:20:15,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:15,614 INFO L350 Elim1Store]: Elim1 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 33372 treesize of output 31516 [2023-02-17 23:20:15,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36632 treesize of output 35288 [2023-02-17 23:20:15,870 INFO L350 Elim1Store]: Elim1 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 3271184 treesize of output 3134766 [2023-02-17 23:20:16,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:20:16,211 INFO L350 Elim1Store]: Elim1 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 3387158 treesize of output 3230190 [2023-02-17 23:20:16,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4238072 treesize of output 4140824 [2023-02-17 23:20:17,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4924440 treesize of output 4766360 [2023-02-17 23:20:17,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5810648 treesize of output 5600216