./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 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/heap-manipulation/bubble_sort_linux-2.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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 10:53:32,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 10:53:32,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 10:53:32,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 10:53:32,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 10:53:32,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 10:53:32,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 10:53:32,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 10:53:32,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 10:53:32,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 10:53:32,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 10:53:32,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 10:53:32,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 10:53:32,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 10:53:32,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 10:53:32,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 10:53:32,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 10:53:32,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 10:53:32,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 10:53:32,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 10:53:32,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 10:53:32,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 10:53:32,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 10:53:32,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 10:53:32,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 10:53:32,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 10:53:32,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 10:53:32,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 10:53:32,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 10:53:32,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 10:53:32,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 10:53:32,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 10:53:32,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 10:53:32,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 10:53:32,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 10:53:32,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 10:53:32,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 10:53:32,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 10:53:32,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 10:53:32,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 10:53:32,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 10:53:32,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 10:53:33,023 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 10:53:33,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 10:53:33,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 10:53:33,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 10:53:33,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 10:53:33,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 10:53:33,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 10:53:33,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 10:53:33,026 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 10:53:33,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 10:53:33,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 10:53:33,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 10:53:33,028 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 10:53:33,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 10:53:33,028 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 10:53:33,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 10:53:33,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:53:33,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 10:53:33,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 10:53:33,030 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 10:53:33,031 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2023-02-14 10:53:33,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 10:53:33,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 10:53:33,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 10:53:33,280 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 10:53:33,280 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 10:53:33,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-02-14 10:53:34,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 10:53:34,509 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 10:53:34,515 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-02-14 10:53:34,526 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148d41513/17f93c0cdafd4343afaa1569a2aeb499/FLAG01a8351e9 [2023-02-14 10:53:34,537 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148d41513/17f93c0cdafd4343afaa1569a2aeb499 [2023-02-14 10:53:34,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 10:53:34,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 10:53:34,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 10:53:34,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 10:53:34,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 10:53:34,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:34,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11dc23cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34, skipping insertion in model container [2023-02-14 10:53:34,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:34,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 10:53:34,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 10:53:34,846 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-02-14 10:53:34,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:53:34,893 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 10:53:34,927 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-02-14 10:53:34,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:53:34,974 INFO L208 MainTranslator]: Completed translation [2023-02-14 10:53:34,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34 WrapperNode [2023-02-14 10:53:34,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 10:53:34,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 10:53:34,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 10:53:34,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 10:53:34,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:34,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,013 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-14 10:53:35,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 10:53:35,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 10:53:35,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 10:53:35,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 10:53:35,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,067 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 10:53:35,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 10:53:35,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 10:53:35,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 10:53:35,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (1/1) ... [2023-02-14 10:53:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:53:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:35,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 10:53:35,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 10:53:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 10:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-14 10:53:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-14 10:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 10:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 10:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-14 10:53:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-14 10:53:35,154 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 10:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-14 10:53:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-14 10:53:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 10:53:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 10:53:35,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 10:53:35,272 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 10:53:35,282 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 10:53:35,564 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 10:53:35,569 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 10:53:35,573 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-14 10:53:35,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:53:35 BoogieIcfgContainer [2023-02-14 10:53:35,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 10:53:35,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 10:53:35,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 10:53:35,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 10:53:35,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:53:34" (1/3) ... [2023-02-14 10:53:35,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e87e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:53:35, skipping insertion in model container [2023-02-14 10:53:35,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:34" (2/3) ... [2023-02-14 10:53:35,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e87e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:53:35, skipping insertion in model container [2023-02-14 10:53:35,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:53:35" (3/3) ... [2023-02-14 10:53:35,597 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-02-14 10:53:35,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 10:53:35,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 10:53:35,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 10:53:35,661 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68c32049, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 10:53:35,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 10:53:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-14 10:53:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 10:53:35,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:35,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:35,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-14 10:53:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:35,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149876010] [2023-02-14 10:53:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:35,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149876010] [2023-02-14 10:53:35,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149876010] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:35,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:35,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 10:53:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510737346] [2023-02-14 10:53:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:35,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 10:53:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 10:53:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:53:35,849 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:53:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:35,882 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-14 10:53:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 10:53:35,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 10:53:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:35,889 INFO L225 Difference]: With dead ends: 230 [2023-02-14 10:53:35,890 INFO L226 Difference]: Without dead ends: 107 [2023-02-14 10:53:35,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:53:35,898 INFO L413 NwaCegarLoop]: 136 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, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:35,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:53:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-14 10:53:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-14 10:53:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 10:53:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-14 10:53:35,929 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-14 10:53:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-14 10:53:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:53:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-14 10:53:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 10:53:35,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:35,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:35,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 10:53:35,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-14 10:53:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:35,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554593934] [2023-02-14 10:53:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:36,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554593934] [2023-02-14 10:53:36,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554593934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:36,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:36,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:53:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573281690] [2023-02-14 10:53:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:36,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:53:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:36,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:53:36,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:53:36,164 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:36,434 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-14 10:53:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 10:53:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-14 10:53:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:36,435 INFO L225 Difference]: With dead ends: 109 [2023-02-14 10:53:36,435 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 10:53:36,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:53:36,437 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:36,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:53:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 10:53:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 10:53:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 10:53:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-14 10:53:36,455 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-14 10:53:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:36,457 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-14 10:53:36,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-14 10:53:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 10:53:36,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:36,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:36,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 10:53:36,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-14 10:53:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:36,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605293194] [2023-02-14 10:53:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:37,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605293194] [2023-02-14 10:53:37,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605293194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:37,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:37,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:53:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347913626] [2023-02-14 10:53:37,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:53:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:53:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:53:37,054 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:37,679 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2023-02-14 10:53:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 10:53:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-02-14 10:53:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:37,682 INFO L225 Difference]: With dead ends: 198 [2023-02-14 10:53:37,682 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 10:53:37,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:53:37,683 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:37,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 157 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 10:53:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2023-02-14 10:53:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 10:53:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-14 10:53:37,727 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-14 10:53:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:37,727 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-14 10:53:37,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-14 10:53:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 10:53:37,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:37,728 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 10:53:37,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 10:53:37,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-14 10:53:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:37,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481019958] [2023-02-14 10:53:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481019958] [2023-02-14 10:53:38,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481019958] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:38,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:38,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:53:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631838185] [2023-02-14 10:53:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:38,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:53:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:53:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:53:38,576 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:39,202 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-14 10:53:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 10:53:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-14 10:53:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:39,205 INFO L225 Difference]: With dead ends: 274 [2023-02-14 10:53:39,205 INFO L226 Difference]: Without dead ends: 271 [2023-02-14 10:53:39,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-14 10:53:39,213 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:39,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 225 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-14 10:53:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-14 10:53:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-14 10:53:39,249 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-14 10:53:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:39,250 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-14 10:53:39,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-14 10:53:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 10:53:39,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:39,252 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-14 10:53:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 10:53:39,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-14 10:53:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:39,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190490938] [2023-02-14 10:53:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190490938] [2023-02-14 10:53:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190490938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:39,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:39,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:53:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807764956] [2023-02-14 10:53:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:39,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:53:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:39,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:53:39,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:53:39,851 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:40,456 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-14 10:53:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 10:53:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-14 10:53:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:40,460 INFO L225 Difference]: With dead ends: 273 [2023-02-14 10:53:40,460 INFO L226 Difference]: Without dead ends: 270 [2023-02-14 10:53:40,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-14 10:53:40,460 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:40,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 247 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-14 10:53:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-14 10:53:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-14 10:53:40,487 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-14 10:53:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:40,488 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-14 10:53:40,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-14 10:53:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 10:53:40,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:40,489 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-02-14 10:53:40,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 10:53:40,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-14 10:53:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:40,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277768901] [2023-02-14 10:53:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:41,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:41,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277768901] [2023-02-14 10:53:41,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277768901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:41,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:41,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 10:53:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775572784] [2023-02-14 10:53:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:53:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:53:41,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:53:41,249 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:41,959 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-14 10:53:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 10:53:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-02-14 10:53:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:41,961 INFO L225 Difference]: With dead ends: 272 [2023-02-14 10:53:41,961 INFO L226 Difference]: Without dead ends: 269 [2023-02-14 10:53:41,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:53:41,962 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:41,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 271 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:53:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-14 10:53:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-14 10:53:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-14 10:53:41,988 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-14 10:53:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:41,990 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-14 10:53:41,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-14 10:53:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 10:53:41,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:41,994 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:41,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 10:53:41,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-14 10:53:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:41,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79658050] [2023-02-14 10:53:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:42,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:42,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79658050] [2023-02-14 10:53:42,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79658050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:42,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:42,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 10:53:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072690264] [2023-02-14 10:53:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:42,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:53:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:53:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:53:42,963 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:43,793 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-14 10:53:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 10:53:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-14 10:53:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:43,794 INFO L225 Difference]: With dead ends: 271 [2023-02-14 10:53:43,794 INFO L226 Difference]: Without dead ends: 268 [2023-02-14 10:53:43,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:53:43,795 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 333 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:43,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 271 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:53:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-14 10:53:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-14 10:53:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-14 10:53:43,816 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-14 10:53:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:43,816 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-14 10:53:43,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-14 10:53:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 10:53:43,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:43,817 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:43,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 10:53:43,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-14 10:53:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:43,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115147222] [2023-02-14 10:53:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115147222] [2023-02-14 10:53:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115147222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:44,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 10:53:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206150562] [2023-02-14 10:53:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:44,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:53:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:53:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:53:44,430 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:45,137 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-14 10:53:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 10:53:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2023-02-14 10:53:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:45,138 INFO L225 Difference]: With dead ends: 270 [2023-02-14 10:53:45,138 INFO L226 Difference]: Without dead ends: 267 [2023-02-14 10:53:45,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-02-14 10:53:45,139 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:45,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-14 10:53:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-14 10:53:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-14 10:53:45,163 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-14 10:53:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:45,164 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-14 10:53:45,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-14 10:53:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 10:53:45,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:45,166 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:45,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 10:53:45,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-14 10:53:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:45,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181954783] [2023-02-14 10:53:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:53:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:53:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:46,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181954783] [2023-02-14 10:53:46,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181954783] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:46,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604635962] [2023-02-14 10:53:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:46,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:53:46,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 10:53:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:46,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-14 10:53:46,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:53:46,826 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:53:46,827 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 10:53:46,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 10:53:46,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-02-14 10:53:46,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 10:53:46,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 10:53:47,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:47,111 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-02-14 10:53:47,112 INFO L350 Elim1Store]: Elim1 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 119 treesize of output 143 [2023-02-14 10:53:47,118 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 97 [2023-02-14 10:53:47,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 10:53:47,127 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2023-02-14 10:53:47,141 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:53:47,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2023-02-14 10:53:47,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2023-02-14 10:53:47,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 10:53:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:47,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-14 10:53:47,228 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:53:47,228 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 22 [2023-02-14 10:53:47,242 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 10:53:47,242 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 26 [2023-02-14 10:53:47,310 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:53:47,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 10:53:47,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-14 10:53:47,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 10:53:47,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-02-14 10:53:47,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-14 10:53:47,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2023-02-14 10:53:47,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-02-14 10:53:47,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:47,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 10:53:47,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-02-14 10:53:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:47,498 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 22 [2023-02-14 10:53:47,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-14 10:53:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:47,686 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 12 [2023-02-14 10:53:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:47,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:53:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604635962] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:48,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:53:48,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2023-02-14 10:53:48,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443665139] [2023-02-14 10:53:48,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:53:48,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-14 10:53:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:48,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-14 10:53:48,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=820, Unknown=13, NotChecked=0, Total=930 [2023-02-14 10:53:48,022 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 10:53:50,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 10:53:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:51,368 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2023-02-14 10:53:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 10:53:51,368 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-14 10:53:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:51,369 INFO L225 Difference]: With dead ends: 276 [2023-02-14 10:53:51,370 INFO L226 Difference]: Without dead ends: 273 [2023-02-14 10:53:51,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=1477, Unknown=14, NotChecked=0, Total=1722 [2023-02-14 10:53:51,371 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 778 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 179 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:51,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 373 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1929 Invalid, 2 Unknown, 0 Unchecked, 2.8s Time] [2023-02-14 10:53:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-14 10:53:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 257. [2023-02-14 10:53:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 236 states have internal predecessors, (268), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2023-02-14 10:53:51,396 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 40 [2023-02-14 10:53:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:51,396 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2023-02-14 10:53:51,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 10:53:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2023-02-14 10:53:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 10:53:51,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:51,397 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:51,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 10:53:51,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:51,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-14 10:53:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:51,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878472182] [2023-02-14 10:53:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:52,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878472182] [2023-02-14 10:53:52,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878472182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:52,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:52,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:53:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99673823] [2023-02-14 10:53:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:52,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:53:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:52,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:53:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:53:52,561 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:53,562 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2023-02-14 10:53:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 10:53:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-14 10:53:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:53,563 INFO L225 Difference]: With dead ends: 273 [2023-02-14 10:53:53,563 INFO L226 Difference]: Without dead ends: 270 [2023-02-14 10:53:53,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-14 10:53:53,564 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:53,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 10:53:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-14 10:53:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2023-02-14 10:53:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 236 states have internal predecessors, (267), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2023-02-14 10:53:53,593 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 42 [2023-02-14 10:53:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:53,594 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2023-02-14 10:53:53,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2023-02-14 10:53:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 10:53:53,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:53,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:53,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 10:53:53,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-14 10:53:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245616583] [2023-02-14 10:53:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:54,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:53:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:53:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245616583] [2023-02-14 10:53:54,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245616583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711366595] [2023-02-14 10:53:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:54,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:53:54,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 10:53:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:54,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-14 10:53:54,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:53:55,008 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:53:55,008 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 10:53:55,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 10:53:55,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 10:53:55,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 10:53:55,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 10:53:55,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:55,193 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-02-14 10:53:55,194 INFO L350 Elim1Store]: Elim1 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 112 treesize of output 138 [2023-02-14 10:53:55,199 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 94 [2023-02-14 10:53:55,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 10:53:55,206 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2023-02-14 10:53:55,216 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:53:55,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2023-02-14 10:53:55,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:55,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-14 10:53:55,321 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 10:53:55,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2023-02-14 10:53:55,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-14 10:53:55,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:55,336 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 23 [2023-02-14 10:53:55,403 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:53:55,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 10:53:55,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-14 10:53:55,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:53:55,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-14 10:53:55,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-14 10:53:55,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2023-02-14 10:53:55,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-02-14 10:53:55,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:55,598 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 10:53:55,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-14 10:53:55,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:55,615 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 20 [2023-02-14 10:53:55,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:53:55,797 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-14 10:53:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:55,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:53:56,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711366595] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:56,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:53:56,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-02-14 10:53:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924913490] [2023-02-14 10:53:56,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:53:56,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-14 10:53:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-14 10:53:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=750, Unknown=7, NotChecked=0, Total=870 [2023-02-14 10:53:56,072 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 10:53:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:59,754 INFO L93 Difference]: Finished difference Result 274 states and 321 transitions. [2023-02-14 10:53:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 10:53:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2023-02-14 10:53:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:59,756 INFO L225 Difference]: With dead ends: 274 [2023-02-14 10:53:59,756 INFO L226 Difference]: Without dead ends: 271 [2023-02-14 10:53:59,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=235, Invalid=1317, Unknown=8, NotChecked=0, Total=1560 [2023-02-14 10:53:59,757 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 659 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 121 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:59,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 382 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1794 Invalid, 14 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 10:53:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-14 10:53:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 257. [2023-02-14 10:53:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2036199095022624) internal successors, (266), 236 states have internal predecessors, (266), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2023-02-14 10:53:59,794 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 43 [2023-02-14 10:53:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:59,794 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2023-02-14 10:53:59,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 10:53:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2023-02-14 10:53:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 10:53:59,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:59,795 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:59,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:00,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-14 10:54:00,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-14 10:54:00,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:00,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702829349] [2023-02-14 10:54:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 10:54:00,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 10:54:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 10:54:00,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 10:54:00,072 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 10:54:00,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 10:54:00,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 10:54:00,078 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:00,080 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 10:54:00,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:54:00 BoogieIcfgContainer [2023-02-14 10:54:00,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 10:54:00,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 10:54:00,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 10:54:00,123 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 10:54:00,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:53:35" (3/4) ... [2023-02-14 10:54:00,125 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 10:54:00,166 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 10:54:00,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 10:54:00,166 INFO L158 Benchmark]: Toolchain (without parser) took 25626.07ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 125.8MB in the beginning and 298.8MB in the end (delta: -173.0MB). Peak memory consumption was 323.8MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,166 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 10:54:00,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.23ms. Allocated memory is still 176.2MB. Free memory was 125.8MB in the beginning and 99.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 96.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,168 INFO L158 Benchmark]: Boogie Preprocessor took 56.63ms. Allocated memory is still 176.2MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,168 INFO L158 Benchmark]: RCFGBuilder took 503.95ms. Allocated memory is still 176.2MB. Free memory was 94.1MB in the beginning and 142.1MB in the end (delta: -48.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,168 INFO L158 Benchmark]: TraceAbstraction took 24544.52ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 141.4MB in the beginning and 301.9MB in the end (delta: -160.5MB). Peak memory consumption was 337.2MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,169 INFO L158 Benchmark]: Witness Printer took 43.38ms. Allocated memory is still 673.2MB. Free memory was 301.9MB in the beginning and 298.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 10:54:00,173 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.15ms. Allocated memory is still 176.2MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.23ms. Allocated memory is still 176.2MB. Free memory was 125.8MB in the beginning and 99.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 96.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.63ms. Allocated memory is still 176.2MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.95ms. Allocated memory is still 176.2MB. Free memory was 94.1MB in the beginning and 142.1MB in the end (delta: -48.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24544.52ms. Allocated memory was 176.2MB in the beginning and 673.2MB in the end (delta: 497.0MB). Free memory was 141.4MB in the beginning and 301.9MB in the end (delta: -160.5MB). Peak memory consumption was 337.2MB. Max. memory is 16.1GB. * Witness Printer took 43.38ms. Allocated memory is still 673.2MB. Free memory was 301.9MB in the beginning and 298.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L902] node->value = value VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new VAL [gl_list={3:0}, new={-1:4}, new={-1:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->next={-1:4}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->prev={-1:4}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={-1:4}, head={3:0}] [L858] EXPR head->next VAL [gl_list={3:0}, head={-1:4}, head={3:0}, head->next={3:0}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={-1:4}, head={3:0}, head->prev={3:0}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}, node->nested.next={-1:12}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}, node->nested.prev={55:53}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 4374 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4356 mSDsluCounter, 2740 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2278 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11048 IncrementalHoareTripleChecker+Invalid, 11779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 462 mSDtfsCounter, 11048 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=9, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 143 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 14 QuantifiedInterpolants, 10063 SizeOfPredicates, 89 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-14 10:54:00,197 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE