./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:56:39,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:56:39,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:56:39,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:56:39,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:56:39,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:56:39,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:56:39,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:56:39,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:56:39,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:56:39,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:56:39,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:56:39,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:56:40,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:56:40,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:56:40,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:56:40,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:56:40,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:56:40,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:56:40,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:56:40,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:56:40,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:56:40,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:56:40,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:56:40,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:56:40,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:56:40,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:56:40,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:56:40,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:56:40,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:56:40,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:56:40,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:56:40,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:56:40,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:56:40,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:56:40,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:56:40,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:56:40,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:56:40,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:56:40,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:56:40,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:56:40,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:56:40,053 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:56:40,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:56:40,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:56:40,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:56:40,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:56:40,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:56:40,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:56:40,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:56:40,056 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:56:40,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:56:40,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:56:40,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:56:40,058 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:56:40,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:56:40,058 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:56:40,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:56:40,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:56:40,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:56:40,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:56:40,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:40,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:56:40,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:56:40,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:56:40,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:56:40,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:56:40,061 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:56:40,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:56:40,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:56:40,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:56:40,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2021-12-15 23:56:40,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:56:40,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:56:40,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:56:40,303 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:56:40,304 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:56:40,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2021-12-15 23:56:40,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c910b2da5/7fdf83469e2f4d59b72b4e2f46fabc9c/FLAG1f50d9563 [2021-12-15 23:56:40,782 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:56:40,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2021-12-15 23:56:40,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c910b2da5/7fdf83469e2f4d59b72b4e2f46fabc9c/FLAG1f50d9563 [2021-12-15 23:56:40,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c910b2da5/7fdf83469e2f4d59b72b4e2f46fabc9c [2021-12-15 23:56:40,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:56:40,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:56:40,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:40,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:56:40,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:56:40,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:40" (1/1) ... [2021-12-15 23:56:40,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18bca7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:40, skipping insertion in model container [2021-12-15 23:56:40,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:40" (1/1) ... [2021-12-15 23:56:40,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:56:40,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:56:41,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2021-12-15 23:56:41,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:41,127 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:56:41,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2021-12-15 23:56:41,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:41,190 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:56:41,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41 WrapperNode [2021-12-15 23:56:41,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:41,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:41,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:56:41,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:56:41,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,240 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2021-12-15 23:56:41,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:41,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:56:41,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:56:41,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:56:41,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:56:41,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:56:41,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:56:41,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:56:41,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:41,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 23:56:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 23:56:41,348 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-15 23:56:41,348 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-15 23:56:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:56:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:56:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:56:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:56:41,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:56:41,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:56:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:56:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:56:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:56:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:56:41,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:56:41,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:56:41,474 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:56:41,475 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:56:41,508 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-15 23:56:41,737 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:56:41,743 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:56:41,743 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 23:56:41,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:41 BoogieIcfgContainer [2021-12-15 23:56:41,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:56:41,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:56:41,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:56:41,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:56:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:56:40" (1/3) ... [2021-12-15 23:56:41,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510d5d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:41, skipping insertion in model container [2021-12-15 23:56:41,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41" (2/3) ... [2021-12-15 23:56:41,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510d5d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:41, skipping insertion in model container [2021-12-15 23:56:41,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:41" (3/3) ... [2021-12-15 23:56:41,751 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2021-12-15 23:56:41,755 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:56:41,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:56:41,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:56:41,798 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:56:41,798 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:56:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 23:56:41,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:41,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:41,822 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2021-12-15 23:56:41,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:41,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638802918] [2021-12-15 23:56:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:41,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:41,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:41,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638802918] [2021-12-15 23:56:41,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638802918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:41,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:41,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:56:41,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208293073] [2021-12-15 23:56:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:41,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:56:41,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:56:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:56:41,988 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:42,005 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2021-12-15 23:56:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:56:42,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 23:56:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:42,014 INFO L225 Difference]: With dead ends: 64 [2021-12-15 23:56:42,014 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 23:56:42,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:56:42,021 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:42,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 23:56:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 23:56:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2021-12-15 23:56:42,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2021-12-15 23:56:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:42,050 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-12-15 23:56:42,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-12-15 23:56:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 23:56:42,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:42,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:42,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:56:42,052 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:42,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2021-12-15 23:56:42,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580139406] [2021-12-15 23:56:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:42,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:42,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580139406] [2021-12-15 23:56:42,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580139406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:42,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:42,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:42,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524330302] [2021-12-15 23:56:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:42,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:42,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:42,141 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:42,152 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-12-15 23:56:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-15 23:56:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:42,154 INFO L225 Difference]: With dead ends: 52 [2021-12-15 23:56:42,154 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:42,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:42,155 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:42,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 23:56:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-12-15 23:56:42,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2021-12-15 23:56:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:42,161 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-12-15 23:56:42,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-12-15 23:56:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:56:42,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:42,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:42,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:56:42,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:42,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2021-12-15 23:56:42,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:42,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513402712] [2021-12-15 23:56:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:42,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:42,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513402712] [2021-12-15 23:56:42,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513402712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:42,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:42,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:42,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304686218] [2021-12-15 23:56:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:42,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:42,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:42,239 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:42,255 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2021-12-15 23:56:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 23:56:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:42,256 INFO L225 Difference]: With dead ends: 57 [2021-12-15 23:56:42,256 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:42,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:42,258 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:42,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-12-15 23:56:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2021-12-15 23:56:42,272 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2021-12-15 23:56:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:42,272 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2021-12-15 23:56:42,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-12-15 23:56:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:56:42,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:42,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:42,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 23:56:42,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2021-12-15 23:56:42,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:42,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369609538] [2021-12-15 23:56:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:42,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:42,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369609538] [2021-12-15 23:56:42,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369609538] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:42,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341055548] [2021-12-15 23:56:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:42,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:42,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:42,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 23:56:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:56:42,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:42,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:42,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341055548] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:56:42,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:56:42,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 23:56:42,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17000094] [2021-12-15 23:56:42,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:42,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:56:42,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:56:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:56:42,665 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:42,680 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2021-12-15 23:56:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:56:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 23:56:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:42,681 INFO L225 Difference]: With dead ends: 53 [2021-12-15 23:56:42,681 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:56:42,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:56:42,683 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:42,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:56:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-15 23:56:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-12-15 23:56:42,687 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2021-12-15 23:56:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:42,688 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-15 23:56:42,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-12-15 23:56:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 23:56:42,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:42,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:42,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:42,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:42,914 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:42,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2021-12-15 23:56:42,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:42,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222281365] [2021-12-15 23:56:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:56:43,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222281365] [2021-12-15 23:56:43,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222281365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:43,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:43,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:43,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690291188] [2021-12-15 23:56:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:43,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:43,038 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,053 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2021-12-15 23:56:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 23:56:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,055 INFO L225 Difference]: With dead ends: 56 [2021-12-15 23:56:43,055 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 23:56:43,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:43,056 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:43,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 23:56:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2021-12-15 23:56:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-15 23:56:43,063 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2021-12-15 23:56:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,065 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-15 23:56:43,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-12-15 23:56:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:56:43,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:43,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:56:43,067 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2021-12-15 23:56:43,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620668441] [2021-12-15 23:56:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:43,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620668441] [2021-12-15 23:56:43,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620668441] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:43,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081548217] [2021-12-15 23:56:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:43,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:43,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:43,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 23:56:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:56:43,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:56:43,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:56:43,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081548217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:43,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:56:43,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-15 23:56:43,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395780101] [2021-12-15 23:56:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:56:43,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:56:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:56:43,447 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,476 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-12-15 23:56:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:56:43,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 23:56:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,481 INFO L225 Difference]: With dead ends: 47 [2021-12-15 23:56:43,482 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 23:56:43,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:56:43,484 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:43,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 23:56:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-15 23:56:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-12-15 23:56:43,497 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2021-12-15 23:56:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,498 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-15 23:56:43,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:56:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-12-15 23:56:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:56:43,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,500 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:43,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:43,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 23:56:43,712 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2021-12-15 23:56:43,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023771333] [2021-12-15 23:56:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:44,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:44,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023771333] [2021-12-15 23:56:44,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023771333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:44,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113842169] [2021-12-15 23:56:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:44,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:44,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:44,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:44,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 23:56:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:44,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-15 23:56:44,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:44,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:56:45,101 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:45,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:45,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-15 23:56:45,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-15 23:56:45,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-15 23:56:45,363 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:45,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-15 23:56:45,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:56:45,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-15 23:56:45,634 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:45,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:56:45,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,803 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:45,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 66 [2021-12-15 23:56:45,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-15 23:56:46,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:46,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,225 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:46,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 127 [2021-12-15 23:56:46,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,243 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:46,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 137 [2021-12-15 23:56:46,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-15 23:56:46,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,265 INFO L354 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2021-12-15 23:56:46,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 55 [2021-12-15 23:56:46,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-15 23:56:46,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:46,395 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:46,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 61 [2021-12-15 23:56:46,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:46,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 23:56:46,548 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:46,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 46 [2021-12-15 23:56:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,559 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:46,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-12-15 23:56:46,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:46,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:46,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_718 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_718) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:47,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse4 .cse0)) (.cse3 (+ (select .cse6 .cse0) 8))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 v_ArrVal_707)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_710) .cse1 v_ArrVal_718) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse4 .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_708))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse6 .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_709))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:47,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select .cse5 .cse1)) (.cse4 (+ (select .cse7 .cse1) 8))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_707)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_710) .cse2 v_ArrVal_718) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse5 .cse1 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_708))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |c_ULTIMATE.start_node_create_#res#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 (store .cse7 .cse1 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_709))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:47,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (= (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_699))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_698)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse10 (select .cse9 .cse1)) (.cse7 (select .cse6 .cse1)) (.cse2 (+ (select (select .cse9 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse3 (select .cse7 .cse2)) (.cse5 (+ (select .cse10 .cse2) 8))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_702))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_707))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_710) .cse3 v_ArrVal_718) (select (select (let ((.cse4 (store (store .cse6 .cse1 (store .cse7 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_708))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse8 (store (store .cse9 .cse1 (store .cse10 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_709))) (store .cse8 .cse3 (store (select .cse8 .cse3) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:47,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_7| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_697)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_695))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_7|))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_node_create_~temp~0#1.base_7|) (= (let ((.cse7 (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_699))) (let ((.cse10 (store .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_698)) (.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select .cse10 .cse2)) (.cse8 (select .cse7 .cse2)) (.cse3 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse8 .cse3)) (.cse6 (+ (select .cse11 .cse3) 8))) (select (select (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_696) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_702))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_707))) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_710) .cse4 v_ArrVal_718) (select (select (let ((.cse5 (store (store .cse7 .cse2 (store .cse8 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_708))) (store .cse5 .cse4 (store (select .cse5 .cse4) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_7|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (let ((.cse9 (store (store .cse10 .cse2 (store .cse11 .cse3 0)) |v_ULTIMATE.start_node_create_~temp~0#1.base_7| v_ArrVal_709))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse6 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2021-12-15 23:56:47,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:47,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:47,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:47,955 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:47,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1233 treesize of output 1226 [2021-12-15 23:56:47,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:47,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:47,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1224 treesize of output 839 [2021-12-15 23:56:48,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:48,019 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:48,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 834 treesize of output 569 [2021-12-15 23:57:06,033 WARN L227 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 215 DAG size of output: 183 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-15 23:57:06,034 INFO L354 Elim1Store]: treesize reduction 96, result has 85.2 percent of original size [2021-12-15 23:57:06,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 46976297184 treesize of output 45061194088