./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/dll2c_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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:09:52,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:09:52,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:09:52,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:09:52,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:09:52,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:09:52,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:09:52,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:09:52,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:09:52,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:09:52,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:09:52,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:09:52,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:09:52,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:09:52,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:09:52,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:09:52,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:09:52,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:09:52,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:09:52,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:09:52,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:09:52,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:09:52,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:09:52,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:09:52,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:09:52,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:09:52,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:09:52,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:09:52,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:09:52,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:09:52,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:09:52,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:09:52,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:09:52,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:09:52,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:09:52,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:09:52,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:09:52,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:09:52,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:09:52,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:09:52,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:09:52,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:09:52,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:09:52,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:09:52,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:09:52,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:09:52,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:09:52,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:09:52,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:09:52,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:09:52,975 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:09:52,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:09:52,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:09:52,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:09:52,977 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:09:52,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:09:52,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:09:52,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:09:52,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:09:52,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:09:52,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:09:52,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:09:52,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:09:52,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:09:52,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:09:52,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:09:52,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:09:52,980 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:09:52,980 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:09:52,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:09:52,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:09:52,980 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2021-12-21 12:09:53,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:09:53,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:09:53,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:09:53,209 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:09:53,209 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:09:53,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-21 12:09:53,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cec874bf/47115aab8a3b48cdaacbbdd27953ae5d/FLAG59f51cff9 [2021-12-21 12:09:53,652 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:09:53,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-21 12:09:53,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cec874bf/47115aab8a3b48cdaacbbdd27953ae5d/FLAG59f51cff9 [2021-12-21 12:09:54,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cec874bf/47115aab8a3b48cdaacbbdd27953ae5d [2021-12-21 12:09:54,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:09:54,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:09:54,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:09:54,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:09:54,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:09:54,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b912070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54, skipping insertion in model container [2021-12-21 12:09:54,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:09:54,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:09:54,370 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/dll2c_insert_unequal.i[25148,25161] [2021-12-21 12:09:54,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:09:54,382 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:09:54,424 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/dll2c_insert_unequal.i[25148,25161] [2021-12-21 12:09:54,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:09:54,443 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:09:54,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54 WrapperNode [2021-12-21 12:09:54,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:09:54,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:09:54,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:09:54,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:09:54,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,493 INFO L137 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2021-12-21 12:09:54,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:09:54,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:09:54,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:09:54,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:09:54,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:09:54,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:09:54,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:09:54,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:09:54,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (1/1) ... [2021-12-21 12:09:54,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:09:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:09:54,564 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-21 12:09:54,565 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-21 12:09:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:09:54,588 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:09:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:09:54,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:09:54,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:09:54,678 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:09:54,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:09:54,916 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:09:54,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:09:54,920 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-21 12:09:54,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:09:54 BoogieIcfgContainer [2021-12-21 12:09:54,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:09:54,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:09:54,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:09:54,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:09:54,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:09:54" (1/3) ... [2021-12-21 12:09:54,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:09:54, skipping insertion in model container [2021-12-21 12:09:54,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:09:54" (2/3) ... [2021-12-21 12:09:54,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:09:54, skipping insertion in model container [2021-12-21 12:09:54,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:09:54" (3/3) ... [2021-12-21 12:09:54,941 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2021-12-21 12:09:54,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:09:54,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:09:54,981 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:09:54,986 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-21 12:09:54,986 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:09:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:09:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:09:55,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:09:55,005 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-21 12:09:55,006 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:09:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:09:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2021-12-21 12:09:55,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:09:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759558840] [2021-12-21 12:09:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:09:55,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:09:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:09:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:09:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:09:55,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:09:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759558840] [2021-12-21 12:09:55,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759558840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:09:55,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:09:55,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:09:55,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478815650] [2021-12-21 12:09:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:09:55,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:09:55,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:09:55,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:09:55,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:09:55,262 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:09:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:09:55,357 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2021-12-21 12:09:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:09:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-21 12:09:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:09:55,367 INFO L225 Difference]: With dead ends: 79 [2021-12-21 12:09:55,368 INFO L226 Difference]: Without dead ends: 36 [2021-12-21 12:09:55,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 12:09:55,374 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:09:55,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:09:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-21 12:09:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-21 12:09:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:09:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-21 12:09:55,416 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2021-12-21 12:09:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:09:55,418 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-21 12:09:55,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:09:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-12-21 12:09:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:09:55,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:09:55,421 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-21 12:09:55,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:09:55,422 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:09:55,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:09:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2021-12-21 12:09:55,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:09:55,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724434902] [2021-12-21 12:09:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:09:55,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:09:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:09:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:09:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:09:55,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:09:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724434902] [2021-12-21 12:09:55,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724434902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:09:55,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:09:55,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:09:55,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428738395] [2021-12-21 12:09:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:09:55,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:09:55,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:09:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:09:55,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:09:55,583 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:09:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:09:55,636 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2021-12-21 12:09:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:09:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-21 12:09:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:09:55,638 INFO L225 Difference]: With dead ends: 68 [2021-12-21 12:09:55,638 INFO L226 Difference]: Without dead ends: 41 [2021-12-21 12:09:55,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:09:55,639 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:09:55,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:09:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-21 12:09:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2021-12-21 12:09:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:09:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-12-21 12:09:55,645 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2021-12-21 12:09:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:09:55,645 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-12-21 12:09:55,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:09:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2021-12-21 12:09:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 12:09:55,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:09:55,647 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:09:55,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:09:55,647 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:09:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:09:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2021-12-21 12:09:55,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:09:55,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555639452] [2021-12-21 12:09:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:09:55,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:09:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:09:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:09:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:09:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:09:55,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:09:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555639452] [2021-12-21 12:09:55,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555639452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:09:55,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:09:55,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:09:55,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519705562] [2021-12-21 12:09:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:09:55,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:09:55,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:09:55,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:09:55,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:09:55,794 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:09:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:09:55,866 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2021-12-21 12:09:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:09:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-21 12:09:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:09:55,868 INFO L225 Difference]: With dead ends: 67 [2021-12-21 12:09:55,869 INFO L226 Difference]: Without dead ends: 53 [2021-12-21 12:09:55,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:09:55,873 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:09:55,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:09:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-21 12:09:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2021-12-21 12:09:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:09:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-12-21 12:09:55,887 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2021-12-21 12:09:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:09:55,888 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-21 12:09:55,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:09:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2021-12-21 12:09:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 12:09:55,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:09:55,890 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:09:55,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 12:09:55,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:09:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:09:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2021-12-21 12:09:55,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:09:55,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202744606] [2021-12-21 12:09:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:09:55,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:09:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:09:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:09:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:09:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:09:56,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:09:56,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202744606] [2021-12-21 12:09:56,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202744606] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:09:56,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864996800] [2021-12-21 12:09:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:09:56,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:09:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:09:56,965 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-21 12:09:56,970 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-21 12:09:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:09:57,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 192 conjunts are in the unsatisfiable core [2021-12-21 12:09:57,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:09:57,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:09:57,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:09:58,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:58,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:58,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-21 12:09:58,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:09:58,148 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:09:58,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:09:58,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:09:58,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 12:09:58,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 12:09:58,406 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:09:58,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2021-12-21 12:09:58,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-21 12:09:58,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:09:58,712 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 12:09:58,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 71 [2021-12-21 12:09:58,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:58,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-21 12:09:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:58,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-21 12:09:58,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-21 12:09:58,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 12:09:58,979 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-21 12:09:58,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 51 [2021-12-21 12:09:58,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:09:59,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:09:59,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-21 12:09:59,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,348 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-21 12:09:59,349 INFO L387 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 5 case distinctions, treesize of input 119 treesize of output 101 [2021-12-21 12:09:59,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:09:59,373 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:09:59,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:09:59,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 12:09:59,886 INFO L353 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2021-12-21 12:09:59,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 172 [2021-12-21 12:09:59,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,926 INFO L353 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2021-12-21 12:09:59,927 INFO L387 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 5 case distinctions, treesize of input 298 treesize of output 233 [2021-12-21 12:09:59,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 73 [2021-12-21 12:09:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,960 INFO L353 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-12-21 12:09:59,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 160 [2021-12-21 12:09:59,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,986 INFO L353 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2021-12-21 12:09:59,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 162 [2021-12-21 12:09:59,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:09:59,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2021-12-21 12:10:00,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-21 12:10:00,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-21 12:10:00,100 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:10:00,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2021-12-21 12:10:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:00,106 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 12:10:00,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2021-12-21 12:10:00,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:00,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:00,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2021-12-21 12:10:00,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2021-12-21 12:10:00,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse3 (select .cse5 .cse1))) (select (select (let ((.cse2 (store (store |c_#memory_int| .cse4 (store (select |c_#memory_int| .cse4) .cse1 v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_735))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_745) .cse3 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_744) .cse3 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2021-12-21 12:10:00,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_763 (Array Int Int)) (v_ArrVal_730 (Array Int Int)) (v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| Int) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_763))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_761)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select .cse7 .cse3)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select .cse5 .cse3))) (let ((.cse1 (select .cse6 .cse4))) (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_762))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_751))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store .cse5 .cse3 (store .cse6 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse7 .cse3 (store .cse8 .cse4 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse8 .cse4))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|) 0))))))) is different from false [2021-12-21 12:10:00,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864996800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:00,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:00,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2021-12-21 12:10:00,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125861023] [2021-12-21 12:10:00,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:00,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-21 12:10:00,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-21 12:10:00,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2203, Unknown=6, NotChecked=388, Total=2756 [2021-12-21 12:10:00,468 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:03,304 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2021-12-21 12:10:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 12:10:03,304 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2021-12-21 12:10:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:03,306 INFO L225 Difference]: With dead ends: 78 [2021-12-21 12:10:03,306 INFO L226 Difference]: Without dead ends: 76 [2021-12-21 12:10:03,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=243, Invalid=3073, Unknown=6, NotChecked=460, Total=3782 [2021-12-21 12:10:03,308 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:03,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 536 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1395 Invalid, 0 Unknown, 6 Unchecked, 1.9s Time] [2021-12-21 12:10:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-21 12:10:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2021-12-21 12:10:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:10:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2021-12-21 12:10:03,315 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2021-12-21 12:10:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:03,315 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2021-12-21 12:10:03,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2021-12-21 12:10:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:10:03,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:03,317 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:03,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 12:10:03,519 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-21 12:10:03,519 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2021-12-21 12:10:03,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:03,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228031950] [2021-12-21 12:10:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:03,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:10:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:10:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:10:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:03,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228031950] [2021-12-21 12:10:03,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228031950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:03,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:03,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 12:10:03,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363230066] [2021-12-21 12:10:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:03,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:10:03,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:10:03,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:10:03,641 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:03,698 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2021-12-21 12:10:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:10:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-12-21 12:10:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:03,700 INFO L225 Difference]: With dead ends: 70 [2021-12-21 12:10:03,700 INFO L226 Difference]: Without dead ends: 53 [2021-12-21 12:10:03,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:10:03,700 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:03,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-21 12:10:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-21 12:10:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:10:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2021-12-21 12:10:03,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 37 [2021-12-21 12:10:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:03,705 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2021-12-21 12:10:03,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2021-12-21 12:10:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:10:03,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:03,706 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:03,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 12:10:03,706 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2021-12-21 12:10:03,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:03,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45699239] [2021-12-21 12:10:03,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:03,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:10:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:10:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:10:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:03,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:03,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45699239] [2021-12-21 12:10:03,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45699239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:03,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:03,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 12:10:03,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064220288] [2021-12-21 12:10:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:03,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 12:10:03,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:03,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 12:10:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:10:03,843 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:03,899 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2021-12-21 12:10:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 12:10:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-12-21 12:10:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:03,902 INFO L225 Difference]: With dead ends: 71 [2021-12-21 12:10:03,902 INFO L226 Difference]: Without dead ends: 53 [2021-12-21 12:10:03,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:10:03,904 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:03,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-21 12:10:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-21 12:10:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:10:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-21 12:10:03,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 37 [2021-12-21 12:10:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:03,920 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-21 12:10:03,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-21 12:10:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 12:10:03,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:03,921 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:03,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 12:10:03,921 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2021-12-21 12:10:03,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:03,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670551272] [2021-12-21 12:10:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:03,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:10:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:10:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:10:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:04,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:04,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670551272] [2021-12-21 12:10:04,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670551272] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:04,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257556253] [2021-12-21 12:10:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:04,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:04,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:04,073 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-21 12:10:04,103 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-21 12:10:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:04,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 12:10:04,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:04,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:04,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:04,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:04,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257556253] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:10:04,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:10:04,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-21 12:10:04,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525439125] [2021-12-21 12:10:04,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:04,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:10:04,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:04,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:10:04,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:10:04,538 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:10:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:04,648 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2021-12-21 12:10:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 12:10:04,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-12-21 12:10:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:04,649 INFO L225 Difference]: With dead ends: 82 [2021-12-21 12:10:04,649 INFO L226 Difference]: Without dead ends: 67 [2021-12-21 12:10:04,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 12:10:04,650 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:04,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 164 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:10:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-21 12:10:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-12-21 12:10:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:10:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2021-12-21 12:10:04,655 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 38 [2021-12-21 12:10:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:04,655 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2021-12-21 12:10:04,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:10:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2021-12-21 12:10:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 12:10:04,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:04,656 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:04,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 12:10:04,868 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,SelfDestructingSolverStorable6 [2021-12-21 12:10:04,869 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2021-12-21 12:10:04,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:04,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71656699] [2021-12-21 12:10:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:04,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:10:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:10:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:10:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:10:05,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71656699] [2021-12-21 12:10:05,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71656699] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039659442] [2021-12-21 12:10:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:05,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:05,112 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-21 12:10:05,115 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-21 12:10:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:05,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-21 12:10:05,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:05,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 12:10:05,627 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639) |c_#memory_$Pointer$.base|)))) is different from true [2021-12-21 12:10:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:05,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 12:10:05,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 12:10:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-12-21 12:10:05,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:05,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_2642 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_2642) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2021-12-21 12:10:05,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039659442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:05,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:05,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2021-12-21 12:10:05,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159232949] [2021-12-21 12:10:05,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:05,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-21 12:10:05,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-21 12:10:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=622, Unknown=2, NotChecked=102, Total=812 [2021-12-21 12:10:05,842 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:10:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:06,236 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2021-12-21 12:10:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 12:10:06,237 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2021-12-21 12:10:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:06,237 INFO L225 Difference]: With dead ends: 67 [2021-12-21 12:10:06,238 INFO L226 Difference]: Without dead ends: 51 [2021-12-21 12:10:06,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1041, Unknown=2, NotChecked=134, Total=1332 [2021-12-21 12:10:06,239 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 54 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:06,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 415 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2021-12-21 12:10:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-21 12:10:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-21 12:10:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 12:10:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2021-12-21 12:10:06,244 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2021-12-21 12:10:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:06,244 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2021-12-21 12:10:06,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:10:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2021-12-21 12:10:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 12:10:06,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:06,245 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:06,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:06,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:06,445 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2021-12-21 12:10:06,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:10:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758438934] [2021-12-21 12:10:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:06,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:10:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:10:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:10:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-21 12:10:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:10:07,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:10:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758438934] [2021-12-21 12:10:07,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758438934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535138190] [2021-12-21 12:10:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:07,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:07,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:10:07,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:10:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:08,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 170 conjunts are in the unsatisfiable core [2021-12-21 12:10:08,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:08,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:10:08,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:10:08,216 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 167663 column 46: unknown constant v_#valid_BEFORE_CALL_6 [2021-12-21 12:10:08,216 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:10:08,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-21 12:10:08,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293982120] [2021-12-21 12:10:08,216 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:08,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-21 12:10:08,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:10:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-21 12:10:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2021-12-21 12:10:08,218 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 25 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:10:08,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2021-12-21 12:10:08,219 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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-21 12:10:08,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:08,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:08,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:10:08,443 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@11ea1456 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-21 12:10:08,446 INFO L158 Benchmark]: Toolchain (without parser) took 14386.37ms. Allocated memory was 96.5MB in the beginning and 207.6MB in the end (delta: 111.1MB). Free memory was 65.4MB in the beginning and 81.9MB in the end (delta: -16.4MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,446 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 12:10:08,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.09ms. Allocated memory is still 96.5MB. Free memory was 65.2MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.77ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,447 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 59.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,447 INFO L158 Benchmark]: RCFGBuilder took 394.62ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 59.3MB in the beginning and 87.4MB in the end (delta: -28.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,447 INFO L158 Benchmark]: TraceAbstraction took 13522.83ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 86.9MB in the beginning and 81.9MB in the end (delta: 5.0MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2021-12-21 12:10:08,448 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.09ms. Allocated memory is still 96.5MB. Free memory was 65.2MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.77ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 59.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.62ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 59.3MB in the beginning and 87.4MB in the end (delta: -28.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13522.83ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 86.9MB in the beginning and 81.9MB in the end (delta: 5.0MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@11ea1456 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@11ea1456: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 12:10:08,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:10:10,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:10:10,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:10:10,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:10:10,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:10:10,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:10:10,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:10:10,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:10:10,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:10:10,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:10:10,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:10:10,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:10:10,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:10:10,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:10:10,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:10:10,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:10:10,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:10:10,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:10:10,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:10:10,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:10:10,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:10:10,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:10:10,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:10:10,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:10:10,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:10:10,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:10:10,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:10:10,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:10:10,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:10:10,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:10:10,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:10:10,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:10:10,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:10:10,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:10:10,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:10:10,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:10:10,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:10:10,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:10:10,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:10:10,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:10:10,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:10:10,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-21 12:10:10,364 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:10:10,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:10:10,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:10:10,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:10:10,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:10:10,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:10:10,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:10:10,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:10:10,367 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:10:10,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:10:10,368 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:10:10,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:10:10,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 12:10:10,369 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:10:10,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:10:10,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:10:10,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:10:10,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:10:10,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:10:10,371 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 12:10:10,371 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 12:10:10,371 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:10:10,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:10:10,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:10:10,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:10:10,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 12:10:10,372 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2021-12-21 12:10:10,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:10:10,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:10:10,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:10:10,665 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:10:10,679 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:10:10,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-21 12:10:10,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e8760b0/41f60daa5f0a48ab9a992d9323a224b4/FLAGacf056744 [2021-12-21 12:10:11,193 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:10:11,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-21 12:10:11,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e8760b0/41f60daa5f0a48ab9a992d9323a224b4/FLAGacf056744 [2021-12-21 12:10:11,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e8760b0/41f60daa5f0a48ab9a992d9323a224b4 [2021-12-21 12:10:11,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:10:11,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:10:11,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:11,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:10:11,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:10:11,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:11" (1/1) ... [2021-12-21 12:10:11,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcc2798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:11, skipping insertion in model container [2021-12-21 12:10:11,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:11" (1/1) ... [2021-12-21 12:10:11,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:10:11,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:10:11,914 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/dll2c_insert_unequal.i[25148,25161] [2021-12-21 12:10:11,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:11,928 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:10:11,979 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/dll2c_insert_unequal.i[25148,25161] [2021-12-21 12:10:11,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:12,010 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:10:12,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12 WrapperNode [2021-12-21 12:10:12,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:12,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:10:12,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:10:12,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:10:12,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,078 INFO L137 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-12-21 12:10:12,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:10:12,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:10:12,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:10:12,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:10:12,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:10:12,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:10:12,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:10:12,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:10:12,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (1/1) ... [2021-12-21 12:10:12,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:10:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:10:12,173 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-21 12:10:12,182 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-21 12:10:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:10:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:10:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:10:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:10:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 12:10:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:10:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 12:10:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:10:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:10:12,317 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:10:12,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:10:12,832 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:10:12,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:10:12,837 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-21 12:10:12,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:10:12 BoogieIcfgContainer [2021-12-21 12:10:12,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:10:12,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:10:12,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:10:12,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:10:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:10:11" (1/3) ... [2021-12-21 12:10:12,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a85e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:10:12, skipping insertion in model container [2021-12-21 12:10:12,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:12" (2/3) ... [2021-12-21 12:10:12,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a85e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:10:12, skipping insertion in model container [2021-12-21 12:10:12,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:10:12" (3/3) ... [2021-12-21 12:10:12,849 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2021-12-21 12:10:12,854 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:10:12,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:10:12,901 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:10:12,908 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-21 12:10:12,908 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:10:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:10:12,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:12,927 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-21 12:10:12,928 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2021-12-21 12:10:12,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683947911] [2021-12-21 12:10:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:12,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:12,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 12:10:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:13,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-21 12:10:13,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:13,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:10:13,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683947911] [2021-12-21 12:10:13,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683947911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:13,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:13,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 12:10:13,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246112933] [2021-12-21 12:10:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:13,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 12:10:13,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 12:10:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:10:13,201 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:13,215 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2021-12-21 12:10:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:10:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-21 12:10:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:13,221 INFO L225 Difference]: With dead ends: 79 [2021-12-21 12:10:13,222 INFO L226 Difference]: Without dead ends: 36 [2021-12-21 12:10:13,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-21 12:10:13,226 INFO L933 BasicCegarLoop]: 58 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, 58 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-21 12:10:13,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-21 12:10:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-21 12:10:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-21 12:10:13,254 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2021-12-21 12:10:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:13,255 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-21 12:10:13,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-12-21 12:10:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:10:13,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:13,257 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-21 12:10:13,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:13,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 12:10:13,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2021-12-21 12:10:13,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:13,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047671326] [2021-12-21 12:10:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:13,469 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:13,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:13,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 12:10:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:13,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 12:10:13,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:13,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:10:13,658 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047671326] [2021-12-21 12:10:13,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047671326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:13,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:13,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:10:13,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133969916] [2021-12-21 12:10:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:13,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:10:13,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:10:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:10:13,661 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:13,680 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2021-12-21 12:10:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:10:13,681 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-21 12:10:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:13,682 INFO L225 Difference]: With dead ends: 68 [2021-12-21 12:10:13,682 INFO L226 Difference]: Without dead ends: 41 [2021-12-21 12:10:13,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-21 12:10:13,683 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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-21 12:10:13,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-21 12:10:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2021-12-21 12:10:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-12-21 12:10:13,689 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2021-12-21 12:10:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:13,689 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-12-21 12:10:13,689 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 12:10:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2021-12-21 12:10:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 12:10:13,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:13,690 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:13,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:13,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 12:10:13,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:13,901 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2021-12-21 12:10:13,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441628199] [2021-12-21 12:10:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:13,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:13,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:13,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 12:10:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:14,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:10:14,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:14,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:10:14,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:14,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441628199] [2021-12-21 12:10:14,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441628199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:10:14,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:10:14,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:10:14,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464254979] [2021-12-21 12:10:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:10:14,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:10:14,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:10:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:10:14,151 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:14,187 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-12-21 12:10:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:10:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2021-12-21 12:10:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:14,189 INFO L225 Difference]: With dead ends: 55 [2021-12-21 12:10:14,189 INFO L226 Difference]: Without dead ends: 38 [2021-12-21 12:10:14,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:10:14,190 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:14,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-21 12:10:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-21 12:10:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:10:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2021-12-21 12:10:14,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 35 [2021-12-21 12:10:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:14,195 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2021-12-21 12:10:14,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:10:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2021-12-21 12:10:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 12:10:14,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:14,196 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:14,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:14,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 12:10:14,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2021-12-21 12:10:14,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:14,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464960780] [2021-12-21 12:10:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:14,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:14,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:14,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 12:10:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:14,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-21 12:10:14,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:14,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:10:14,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 12:10:15,035 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 12:10:15,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-21 12:10:15,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 12:10:15,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:10:15,395 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-21 12:10:15,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2021-12-21 12:10:15,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:10:15,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 12:10:15,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:15,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:15,985 INFO L353 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2021-12-21 12:10:15,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 105 [2021-12-21 12:10:16,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:16,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2021-12-21 12:10:16,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2021-12-21 12:10:16,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 53 [2021-12-21 12:10:16,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-21 12:10:16,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-21 12:10:16,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 12:10:16,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-21 12:10:16,326 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:10:16,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 38 [2021-12-21 12:10:16,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-12-21 12:10:16,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 24 treesize of output 18 [2021-12-21 12:10:16,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:10:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:16,648 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:10:16,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 63 [2021-12-21 12:10:16,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:16,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:10:16,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:16,690 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-21 12:10:16,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2021-12-21 12:10:16,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:17,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:17,519 INFO L353 Elim1Store]: treesize reduction 209, result has 11.4 percent of original size [2021-12-21 12:10:17,519 INFO L387 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 8 case distinctions, treesize of input 229 treesize of output 108 [2021-12-21 12:10:17,610 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:10:17,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 243 treesize of output 163 [2021-12-21 12:10:17,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2021-12-21 12:10:17,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:17,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2021-12-21 12:10:17,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2021-12-21 12:10:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:17,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:17,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2021-12-21 12:10:18,067 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:10:18,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 138 [2021-12-21 12:10:18,099 INFO L353 Elim1Store]: treesize reduction 67, result has 5.6 percent of original size [2021-12-21 12:10:18,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 43 [2021-12-21 12:10:18,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:10:18,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:18,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_444 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_444)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_448) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 12:10:18,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_444 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_444)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_456) .cse0 v_ArrVal_448) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse0))) .cse0 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_450) .cse0 v_ArrVal_465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-21 12:10:18,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_ArrVal_444 (_ BitVec 32)) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse4 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_444)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_456) .cse2 v_ArrVal_448) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 (store .cse4 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse2))) .cse2 v_ArrVal_447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_450) .cse2 v_ArrVal_465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2021-12-21 12:10:20,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464960780] [2021-12-21 12:10:20,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464960780] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1444293936] [2021-12-21 12:10:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:20,212 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-21 12:10:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-21 12:10:20,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-21 12:10:20,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-12-21 12:10:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:20,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-21 12:10:20,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:21,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:10:21,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:10:22,061 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 12:10:22,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-21 12:10:22,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 12:10:22,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:10:22,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:22,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:10:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:22,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2021-12-21 12:10:22,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:22,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2021-12-21 12:10:22,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-21 12:10:22,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-21 12:10:23,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2021-12-21 12:10:23,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:10:23,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:23,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-21 12:10:23,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-21 12:10:23,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 12:10:23,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:23,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-21 12:10:24,000 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-21 12:10:24,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:10:24,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:25,870 INFO L353 Elim1Store]: treesize reduction 329, result has 23.0 percent of original size [2021-12-21 12:10:25,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 860 treesize of output 519 [2021-12-21 12:10:25,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:25,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:26,361 INFO L353 Elim1Store]: treesize reduction 183, result has 38.0 percent of original size [2021-12-21 12:10:26,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 757 treesize of output 675 [2021-12-21 12:10:26,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2021-12-21 12:10:26,574 INFO L353 Elim1Store]: treesize reduction 100, result has 42.9 percent of original size [2021-12-21 12:10:26,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 140 [2021-12-21 12:10:26,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-21 12:10:26,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-21 12:10:26,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-21 12:10:26,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-21 12:10:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:29,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 408 treesize of output 416 [2021-12-21 12:10:29,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:29,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:29,812 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:10:29,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 93 [2021-12-21 12:10:29,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-21 12:10:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:30,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:30,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2021-12-21 12:10:31,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:31,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:31,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-12-21 12:10:31,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-21 12:10:31,483 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:32,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:32,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:32,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2021-12-21 12:10:32,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-21 12:10:32,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:32,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:32,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 64 [2021-12-21 12:10:32,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-21 12:10:34,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-21 12:10:34,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2021-12-21 12:10:35,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2021-12-21 12:10:35,151 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:35,201 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 12:10:35,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2021-12-21 12:10:35,260 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:35,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:35,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:35,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2021-12-21 12:10:37,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-21 12:10:37,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-21 12:10:37,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:37,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 78 [2021-12-21 12:10:38,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2021-12-21 12:10:38,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:38,063 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2021-12-21 12:10:38,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:38,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2021-12-21 12:10:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 69 [2021-12-21 12:10:39,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2021-12-21 12:10:39,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2021-12-21 12:10:39,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:39,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,159 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2021-12-21 12:10:39,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 346 treesize of output 315 [2021-12-21 12:10:39,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:39,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,648 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-21 12:10:39,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 89 [2021-12-21 12:10:39,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:39,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,753 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-12-21 12:10:39,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 89 [2021-12-21 12:10:39,757 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:39,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:39,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2021-12-21 12:10:40,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:40,322 INFO L353 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2021-12-21 12:10:40,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 231 [2021-12-21 12:10:40,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 12:10:40,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-21 12:10:40,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:40,877 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-21 12:10:40,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 222 treesize of output 200 [2021-12-21 12:10:40,882 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-21 12:10:40,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-21 12:10:41,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:41,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:41,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2021-12-21 12:10:41,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:41,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:10:41,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2021-12-21 12:10:41,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2021-12-21 12:10:41,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-12-21 12:10:41,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 186 [2021-12-21 12:10:41,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-21 12:10:41,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-21 12:10:42,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-12-21 12:10:42,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:42,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:10:42,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:42,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (_ BitVec 32)) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_623 (_ BitVec 32)) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_622 (_ BitVec 32))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_623)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_631))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 v_ArrVal_634))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_638) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 v_ArrVal_622)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_625) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 v_ArrVal_621)) |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-21 12:10:42,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (_ BitVec 32)) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_623 (_ BitVec 32)) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_622 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_623)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_631))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_634))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_632) .cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_639) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_638) .cse1) .cse2 v_ArrVal_622)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_624) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_637) .cse1 (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_629) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_625) .cse1) .cse2 v_ArrVal_621)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-12-21 12:10:42,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (_ BitVec 32)) (v_ArrVal_637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_623 (_ BitVec 32)) (v_ArrVal_634 (_ BitVec 32)) (v_ArrVal_622 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (.cse2 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 (store (select |c_#memory_int| .cse3) .cse4 v_ArrVal_623)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_631))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_634))) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_636) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_632) .cse1 (store (select (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_639) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_638) .cse1) .cse2 v_ArrVal_622)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_624) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_637) .cse1 (store (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_629) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_625) .cse1) .cse2 v_ArrVal_621)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-21 12:10:44,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1444293936] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:10:44,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:44,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2021-12-21 12:10:44,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371939428] [2021-12-21 12:10:44,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:44,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-21 12:10:44,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-21 12:10:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2468, Unknown=18, NotChecked=630, Total=3306 [2021-12-21 12:10:44,690 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 47 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:52,451 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2021-12-21 12:10:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 12:10:52,452 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2021-12-21 12:10:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:52,454 INFO L225 Difference]: With dead ends: 62 [2021-12-21 12:10:52,455 INFO L226 Difference]: Without dead ends: 60 [2021-12-21 12:10:52,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=294, Invalid=3872, Unknown=18, NotChecked=786, Total=4970 [2021-12-21 12:10:52,457 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:52,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 608 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 515 Invalid, 0 Unknown, 283 Unchecked, 4.4s Time] [2021-12-21 12:10:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-21 12:10:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-12-21 12:10:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2021-12-21 12:10:52,464 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 36 [2021-12-21 12:10:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:52,464 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-12-21 12:10:52,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2021-12-21 12:10:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:10:52,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:52,466 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:52,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:52,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:52,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-21 12:10:52,867 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2021-12-21 12:10:52,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:52,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765828968] [2021-12-21 12:10:52,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:10:52,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:52,870 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:52,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 12:10:53,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:10:53,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:10:53,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 12:10:53,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:53,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:53,761 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:53,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765828968] [2021-12-21 12:10:53,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765828968] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:10:53,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:53,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-21 12:10:53,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783607512] [2021-12-21 12:10:53,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:53,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:10:53,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:10:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:10:53,763 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:10:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:53,829 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2021-12-21 12:10:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:10:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2021-12-21 12:10:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:53,831 INFO L225 Difference]: With dead ends: 77 [2021-12-21 12:10:53,831 INFO L226 Difference]: Without dead ends: 59 [2021-12-21 12:10:53,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 12:10:53,832 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 75 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:53,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:10:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-21 12:10:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-21 12:10:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2021-12-21 12:10:53,839 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 37 [2021-12-21 12:10:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:53,839 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2021-12-21 12:10:53,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:10:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2021-12-21 12:10:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 12:10:53,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:53,840 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:53,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:54,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 12:10:54,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2021-12-21 12:10:54,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:54,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742086934] [2021-12-21 12:10:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:54,055 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:54,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:54,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:54,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 12:10:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:10:54,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 12:10:54,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:10:54,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:54,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:10:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:54,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:10:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:10:54,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:10:54,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742086934] [2021-12-21 12:10:54,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742086934] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:10:54,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:10:54,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-21 12:10:54,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132221974] [2021-12-21 12:10:54,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:10:54,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 12:10:54,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:10:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 12:10:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 12:10:54,671 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:10:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:10:55,365 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-12-21 12:10:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 12:10:55,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-12-21 12:10:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:10:55,367 INFO L225 Difference]: With dead ends: 88 [2021-12-21 12:10:55,367 INFO L226 Difference]: Without dead ends: 73 [2021-12-21 12:10:55,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:10:55,368 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 12:10:55,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 12:10:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-21 12:10:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2021-12-21 12:10:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:10:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2021-12-21 12:10:55,375 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 38 [2021-12-21 12:10:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:10:55,376 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2021-12-21 12:10:55,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 12:10:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2021-12-21 12:10:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 12:10:55,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:10:55,377 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:10:55,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-21 12:10:55,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 12:10:55,597 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:10:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:10:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2021-12-21 12:10:55,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:10:55,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698499870] [2021-12-21 12:10:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:10:55,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:10:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:10:55,599 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 12:10:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process