/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:30:37,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:30:37,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:30:37,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:30:37,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:30:37,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:30:37,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:30:37,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:30:37,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:30:37,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:30:37,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:30:37,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:30:37,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:30:37,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:30:37,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:30:37,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:30:37,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:30:37,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:30:37,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:30:37,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:30:37,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:30:37,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:30:37,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:30:37,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:30:37,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:30:37,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:30:37,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:30:37,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:30:37,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:30:37,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:30:37,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:30:37,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:30:37,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:30:37,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:30:37,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:30:37,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:30:37,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:30:37,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:30:37,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:30:37,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:30:37,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:30:37,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:30:37,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:30:37,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:30:37,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:30:37,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:30:37,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:30:37,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:30:37,213 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:30:37,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:30:37,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:30:37,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:37,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:30:37,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:30:37,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:30:37,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:30:37,216 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:30:37,216 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:30:37,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:30:37,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:30:37,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:30:37,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:30:37,445 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:30:37,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing.i [2022-01-10 23:30:37,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488c93faf/5e3a7dd4feed47f5921fa96d446bbb44/FLAG31befc91b [2022-01-10 23:30:37,922 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:30:37,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i [2022-01-10 23:30:37,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488c93faf/5e3a7dd4feed47f5921fa96d446bbb44/FLAG31befc91b [2022-01-10 23:30:37,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488c93faf/5e3a7dd4feed47f5921fa96d446bbb44 [2022-01-10 23:30:37,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:30:37,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:30:37,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:37,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:30:37,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:30:37,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:37" (1/1) ... [2022-01-10 23:30:37,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cd4d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:37, skipping insertion in model container [2022-01-10 23:30:37,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:37" (1/1) ... [2022-01-10 23:30:37,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:30:37,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:30:38,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2022-01-10 23:30:38,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:38,270 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:30:38,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i[938,951] [2022-01-10 23:30:38,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:38,327 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:30:38,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38 WrapperNode [2022-01-10 23:30:38,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:38,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:38,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:30:38,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:30:38,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,381 INFO L137 Inliner]: procedures = 125, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2022-01-10 23:30:38,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:38,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:30:38,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:30:38,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:30:38,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:30:38,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:30:38,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:30:38,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:30:38,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:38,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:30:38,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:30:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-01-10 23:30:38,501 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:30:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:30:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:30:38,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:30:38,623 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:30:38,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:30:38,867 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:30:38,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:30:38,874 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 23:30:38,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:38 BoogieIcfgContainer [2022-01-10 23:30:38,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:30:38,876 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:30:38,876 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:30:38,878 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:30:38,880 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:38" (1/1) ... [2022-01-10 23:30:38,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:38 BasicIcfg [2022-01-10 23:30:38,958 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:30:38,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:30:38,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:30:38,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:30:38,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:30:37" (1/4) ... [2022-01-10 23:30:38,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18386d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:38, skipping insertion in model container [2022-01-10 23:30:38,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:38" (2/4) ... [2022-01-10 23:30:38,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18386d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:38, skipping insertion in model container [2022-01-10 23:30:38,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:38" (3/4) ... [2022-01-10 23:30:38,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18386d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:30:38, skipping insertion in model container [2022-01-10 23:30:38,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:38" (4/4) ... [2022-01-10 23:30:38,963 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.iTransformedIcfg [2022-01-10 23:30:38,967 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:30:38,967 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 23:30:38,996 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:30:39,000 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:30:39,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 23:30:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 35 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 23:30:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 23:30:39,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:39,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:39,015 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1870213, now seen corresponding path program 1 times [2022-01-10 23:30:39,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:39,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262762029] [2022-01-10 23:30:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:39,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:39,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262762029] [2022-01-10 23:30:39,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262762029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:39,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:39,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:30:39,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485009676] [2022-01-10 23:30:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:39,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:30:39,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:30:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:30:39,257 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 35 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 23:30:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:39,277 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-01-10 23:30:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:30:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-10 23:30:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:39,292 INFO L225 Difference]: With dead ends: 77 [2022-01-10 23:30:39,293 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 23:30:39,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:30:39,298 INFO L933 BasicCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:39,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 23:30:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 23:30:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 23:30:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 23:30:39,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 19 [2022-01-10 23:30:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:39,330 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 23:30:39,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 23:30:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 23:30:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 23:30:39,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:39,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:39,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:30:39,333 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1154925979, now seen corresponding path program 1 times [2022-01-10 23:30:39,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:39,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112124660] [2022-01-10 23:30:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:39,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:39,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112124660] [2022-01-10 23:30:39,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112124660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:39,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:39,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:30:39,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620425764] [2022-01-10 23:30:39,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:39,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:30:39,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:30:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:30:39,475 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 23:30:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:39,517 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-01-10 23:30:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-10 23:30:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:39,519 INFO L225 Difference]: With dead ends: 42 [2022-01-10 23:30:39,519 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 23:30:39,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:39,524 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:39,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 23:30:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-10 23:30:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 23:30:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-01-10 23:30:39,543 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 19 [2022-01-10 23:30:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:39,544 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-01-10 23:30:39,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 23:30:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-01-10 23:30:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 23:30:39,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:39,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:39,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:30:39,545 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2029966424, now seen corresponding path program 1 times [2022-01-10 23:30:39,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:39,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590656859] [2022-01-10 23:30:39,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:39,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 23:30:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 23:30:39,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590656859] [2022-01-10 23:30:39,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590656859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:39,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:39,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:30:39,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155986910] [2022-01-10 23:30:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:39,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:30:39,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:39,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:30:39,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:30:39,714 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 23:30:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:39,761 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-01-10 23:30:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 23:30:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:39,763 INFO L225 Difference]: With dead ends: 87 [2022-01-10 23:30:39,763 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 23:30:39,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:39,764 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:39,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 132 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 23:30:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-01-10 23:30:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 23:30:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-01-10 23:30:39,776 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 25 [2022-01-10 23:30:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:39,776 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-01-10 23:30:39,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 23:30:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-01-10 23:30:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 23:30:39,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:39,778 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:39,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:30:39,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash -865419746, now seen corresponding path program 1 times [2022-01-10 23:30:39,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:39,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901279783] [2022-01-10 23:30:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:39,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:30:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 23:30:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:39,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901279783] [2022-01-10 23:30:39,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901279783] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539347839] [2022-01-10 23:30:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:39,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:39,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:39,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 23:30:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 23:30:40,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:40,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:40,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539347839] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:40,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:40,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-01-10 23:30:40,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146365709] [2022-01-10 23:30:40,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:40,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 23:30:40,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:40,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 23:30:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:30:40,305 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 23:30:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:40,551 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2022-01-10 23:30:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 23:30:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-01-10 23:30:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:40,556 INFO L225 Difference]: With dead ends: 120 [2022-01-10 23:30:40,556 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 23:30:40,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-01-10 23:30:40,564 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 128 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:40,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 499 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:30:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 23:30:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2022-01-10 23:30:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 54 states have internal predecessors, (69), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 23:30:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2022-01-10 23:30:40,573 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2022-01-10 23:30:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:40,573 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2022-01-10 23:30:40,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 23:30:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2022-01-10 23:30:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 23:30:40,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:40,575 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:40,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 23:30:40,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:40,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1349804752, now seen corresponding path program 1 times [2022-01-10 23:30:40,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480720243] [2022-01-10 23:30:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:40,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:30:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 23:30:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 23:30:40,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480720243] [2022-01-10 23:30:40,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480720243] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710225391] [2022-01-10 23:30:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:40,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:40,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:40,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 23:30:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:40,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 23:30:40,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:41,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:30:41,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710225391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:30:41,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2022-01-10 23:30:41,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627298653] [2022-01-10 23:30:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:41,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:41,047 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 23:30:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,093 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-01-10 23:30:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-01-10 23:30:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,094 INFO L225 Difference]: With dead ends: 114 [2022-01-10 23:30:41,095 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 23:30:41,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:41,095 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 23:30:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-10 23:30:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 56 states have internal predecessors, (70), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-01-10 23:30:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2022-01-10 23:30:41,103 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 30 [2022-01-10 23:30:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,103 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2022-01-10 23:30:41,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 23:30:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2022-01-10 23:30:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 23:30:41,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,104 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-10 23:30:41,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 23:30:41,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:41,319 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1174107104, now seen corresponding path program 1 times [2022-01-10 23:30:41,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456010577] [2022-01-10 23:30:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 23:30:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:30:41,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456010577] [2022-01-10 23:30:41,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456010577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:41,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827019523] [2022-01-10 23:30:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:41,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:41,389 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 23:30:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,410 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-01-10 23:30:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:41,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-10 23:30:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,411 INFO L225 Difference]: With dead ends: 67 [2022-01-10 23:30:41,411 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 23:30:41,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:41,412 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 176 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 23:30:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-01-10 23:30:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 23:30:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-01-10 23:30:41,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 31 [2022-01-10 23:30:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,418 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-01-10 23:30:41,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 23:30:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-01-10 23:30:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 23:30:41,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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] [2022-01-10 23:30:41,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:30:41,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1346828331, now seen corresponding path program 1 times [2022-01-10 23:30:41,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197277303] [2022-01-10 23:30:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 23:30:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:41,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197277303] [2022-01-10 23:30:41,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197277303] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:41,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158159819] [2022-01-10 23:30:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:41,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:41,614 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 23:30:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,709 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2022-01-10 23:30:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-10 23:30:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,710 INFO L225 Difference]: With dead ends: 94 [2022-01-10 23:30:41,710 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 23:30:41,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:41,711 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 140 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:30:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 23:30:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 23:30:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 23:30:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-01-10 23:30:41,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 32 [2022-01-10 23:30:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,716 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-01-10 23:30:41,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 23:30:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-01-10 23:30:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 23:30:41,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,717 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:41,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 23:30:41,717 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -776107193, now seen corresponding path program 1 times [2022-01-10 23:30:41,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273252717] [2022-01-10 23:30:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:30:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 23:30:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:30:41,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273252717] [2022-01-10 23:30:41,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273252717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:30:41,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188411081] [2022-01-10 23:30:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:30:41,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:30:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:41,789 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 23:30:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,831 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-01-10 23:30:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:30:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-01-10 23:30:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,832 INFO L225 Difference]: With dead ends: 53 [2022-01-10 23:30:41,832 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 23:30:41,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:30:41,833 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 221 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 23:30:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-01-10 23:30:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 23:30:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2022-01-10 23:30:41,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 36 [2022-01-10 23:30:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,838 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2022-01-10 23:30:41,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 23:30:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-01-10 23:30:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:30:41,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,839 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2022-01-10 23:30:41,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 23:30:41,839 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1848763390, now seen corresponding path program 1 times [2022-01-10 23:30:41,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280949249] [2022-01-10 23:30:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:30:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 23:30:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 23:30:42,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280949249] [2022-01-10 23:30:42,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280949249] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259021743] [2022-01-10 23:30:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:42,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:42,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 23:30:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 23:30:42,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:42,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:42,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 23:30:42,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:42,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 23:30:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:42,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 23:30:42,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:42,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 23:30:42,675 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:42,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-01-10 23:30:42,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:42,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-01-10 23:30:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 23:30:43,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:43,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2022-01-10 23:30:43,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2022-01-10 23:30:43,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:43,484 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:43,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-01-10 23:30:43,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:43,501 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:43,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2022-01-10 23:30:43,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:43,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2022-01-10 23:30:43,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-01-10 23:30:43,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:43,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-01-10 23:30:43,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-01-10 23:30:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:30:43,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259021743] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:43,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:43,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 33 [2022-01-10 23:30:43,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109458115] [2022-01-10 23:30:43,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:43,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 23:30:43,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 23:30:43,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 23:30:43,757 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 23:30:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:44,611 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2022-01-10 23:30:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 23:30:44,612 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Word has length 42 [2022-01-10 23:30:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:44,613 INFO L225 Difference]: With dead ends: 165 [2022-01-10 23:30:44,613 INFO L226 Difference]: Without dead ends: 126 [2022-01-10 23:30:44,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 23:30:44,616 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 274 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:44,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 958 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 298 Invalid, 0 Unknown, 222 Unchecked, 0.3s Time] [2022-01-10 23:30:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-10 23:30:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 66. [2022-01-10 23:30:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 55 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-10 23:30:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2022-01-10 23:30:44,626 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 42 [2022-01-10 23:30:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:44,626 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2022-01-10 23:30:44,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 23:30:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2022-01-10 23:30:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:30:44,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:44,627 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2022-01-10 23:30:44,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 23:30:44,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:44,830 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:30:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2060114303, now seen corresponding path program 1 times [2022-01-10 23:30:44,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:44,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014354993] [2022-01-10 23:30:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:44,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:30:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 23:30:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:30:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:30:45,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:45,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014354993] [2022-01-10 23:30:45,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014354993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:45,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342744468] [2022-01-10 23:30:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:45,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:45,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:45,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:30:45,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 23:30:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:45,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-10 23:30:45,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 23:30:45,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-10 23:30:45,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 23:30:45,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-10 23:30:46,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:46,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:46,678 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 23:30:46,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2022-01-10 23:30:46,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2022-01-10 23:30:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 23:30:49,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:50,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:50,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:50,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 205 [2022-01-10 23:30:50,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:50,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:50,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 234 treesize of output 134 [2022-01-10 23:30:50,661 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:50,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 952 treesize of output 926 [2022-01-10 23:30:50,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:50,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1230 treesize of output 1162 [2022-01-10 23:30:50,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1154 treesize of output 1126 [2022-01-10 23:30:50,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:50,730 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:30:50,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1476 treesize of output 1280 [2022-01-10 23:30:51,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:51,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:51,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:51,792 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 23:30:51,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:52,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:53,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-01-10 23:30:53,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:53,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:30:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:54,448 INFO L353 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-01-10 23:30:54,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 401 treesize of output 377 [2022-01-10 23:30:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:30:56,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342744468] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:56,835 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:56,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 42 [2022-01-10 23:30:56,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696246335] [2022-01-10 23:30:56,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:56,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 23:30:56,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:56,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 23:30:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1575, Unknown=6, NotChecked=0, Total=1722 [2022-01-10 23:30:56,837 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 42 states, 39 states have (on average 2.0) internal successors, (78), 41 states have internal predecessors, (78), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 23:31:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:02,894 INFO L93 Difference]: Finished difference Result 171 states and 219 transitions. [2022-01-10 23:31:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-10 23:31:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 41 states have internal predecessors, (78), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 42 [2022-01-10 23:31:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:02,896 INFO L225 Difference]: With dead ends: 171 [2022-01-10 23:31:02,896 INFO L226 Difference]: Without dead ends: 125 [2022-01-10 23:31:02,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=381, Invalid=4026, Unknown=15, NotChecked=0, Total=4422 [2022-01-10 23:31:02,897 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 182 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:02,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 802 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 527 Invalid, 0 Unknown, 235 Unchecked, 0.8s Time] [2022-01-10 23:31:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-10 23:31:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-01-10 23:31:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 81 states have internal predecessors, (96), 9 states have call successors, (9), 7 states have call predecessors, (9), 11 states have return successors, (21), 10 states have call predecessors, (21), 9 states have call successors, (21) [2022-01-10 23:31:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2022-01-10 23:31:02,918 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 42 [2022-01-10 23:31:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:02,919 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2022-01-10 23:31:02,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 41 states have internal predecessors, (78), 11 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 23:31:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2022-01-10 23:31:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:31:02,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:02,920 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:02,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:03,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:03,137 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -64349558, now seen corresponding path program 1 times [2022-01-10 23:31:03,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921644178] [2022-01-10 23:31:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:03,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:31:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 23:31:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 23:31:03,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921644178] [2022-01-10 23:31:03,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921644178] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115569722] [2022-01-10 23:31:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:03,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:03,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:31:03,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 23:31:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 23:31:03,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:03,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:31:03,371 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:03,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:31:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 23:31:03,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 23:31:03,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115569722] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:03,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:03,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-10 23:31:03,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45785743] [2022-01-10 23:31:03,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:03,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 23:31:03,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 23:31:03,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:31:03,518 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 23:31:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:03,616 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-01-10 23:31:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:31:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2022-01-10 23:31:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:03,618 INFO L225 Difference]: With dead ends: 124 [2022-01-10 23:31:03,618 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 23:31:03,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:31:03,619 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 132 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:03,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 148 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:31:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 23:31:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-01-10 23:31:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 71 states have internal predecessors, (85), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2022-01-10 23:31:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-01-10 23:31:03,626 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 42 [2022-01-10 23:31:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:03,627 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-01-10 23:31:03,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 23:31:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-01-10 23:31:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 23:31:03,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:03,632 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:03,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:03,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 23:31:03,852 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1869121874, now seen corresponding path program 1 times [2022-01-10 23:31:03,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:03,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417449111] [2022-01-10 23:31:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:03,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:31:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 23:31:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 23:31:03,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417449111] [2022-01-10 23:31:03,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417449111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:03,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:03,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:31:03,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306867647] [2022-01-10 23:31:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:03,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:31:03,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:31:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:31:03,963 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 23:31:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:04,004 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2022-01-10 23:31:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:31:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-01-10 23:31:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:04,007 INFO L225 Difference]: With dead ends: 110 [2022-01-10 23:31:04,007 INFO L226 Difference]: Without dead ends: 108 [2022-01-10 23:31:04,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:31:04,009 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:04,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 256 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:31:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-10 23:31:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2022-01-10 23:31:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 75 states have internal predecessors, (88), 8 states have call successors, (8), 7 states have call predecessors, (8), 12 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2022-01-10 23:31:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-01-10 23:31:04,024 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 43 [2022-01-10 23:31:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:04,025 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-01-10 23:31:04,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 23:31:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-01-10 23:31:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 23:31:04,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:04,025 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:04,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 23:31:04,026 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1386558423, now seen corresponding path program 2 times [2022-01-10 23:31:04,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:04,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671015091] [2022-01-10 23:31:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:04,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 23:31:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 23:31:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:05,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 23:31:05,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671015091] [2022-01-10 23:31:05,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671015091] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346235603] [2022-01-10 23:31:05,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:31:05,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:05,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:05,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:31:05,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 23:31:05,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:31:05,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:31:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 132 conjunts are in the unsatisfiable core [2022-01-10 23:31:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:05,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:05,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:05,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2022-01-10 23:31:05,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-01-10 23:31:05,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2022-01-10 23:31:05,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 23:31:05,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:05,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-01-10 23:31:06,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:06,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:06,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:06,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:06,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:06,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:06,706 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 23:31:06,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 86 [2022-01-10 23:31:06,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:06,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:06,714 INFO L353 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-01-10 23:31:06,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 82 [2022-01-10 23:31:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 23:31:08,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 23:31:17,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346235603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:17,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:17,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 20] total 54 [2022-01-10 23:31:17,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744243867] [2022-01-10 23:31:17,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:17,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-10 23:31:17,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-10 23:31:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2642, Unknown=5, NotChecked=0, Total=2862 [2022-01-10 23:31:17,890 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 53 states have internal predecessors, (91), 14 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 23:31:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:30,437 INFO L93 Difference]: Finished difference Result 349 states and 484 transitions. [2022-01-10 23:31:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-10 23:31:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 53 states have internal predecessors, (91), 14 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Word has length 49 [2022-01-10 23:31:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:30,442 INFO L225 Difference]: With dead ends: 349 [2022-01-10 23:31:30,442 INFO L226 Difference]: Without dead ends: 270 [2022-01-10 23:31:30,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=759, Invalid=9537, Unknown=6, NotChecked=0, Total=10302 [2022-01-10 23:31:30,449 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 363 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:30,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 2115 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1929 Invalid, 0 Unknown, 357 Unchecked, 3.4s Time] [2022-01-10 23:31:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-10 23:31:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 179. [2022-01-10 23:31:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 147 states have internal predecessors, (171), 17 states have call successors, (17), 9 states have call predecessors, (17), 19 states have return successors, (55), 22 states have call predecessors, (55), 17 states have call successors, (55) [2022-01-10 23:31:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2022-01-10 23:31:30,485 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 49 [2022-01-10 23:31:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:30,485 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2022-01-10 23:31:30,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 53 states have internal predecessors, (91), 14 states have call successors, (14), 3 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 23:31:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2022-01-10 23:31:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 23:31:30,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:30,486 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:30,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:30,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:30,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 359108921, now seen corresponding path program 1 times [2022-01-10 23:31:30,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507957710] [2022-01-10 23:31:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:30,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:31:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-10 23:31:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 23:31:31,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:31,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507957710] [2022-01-10 23:31:31,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507957710] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:31,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910584328] [2022-01-10 23:31:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:31,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:31,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:31:31,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 23:31:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:31,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-10 23:31:31,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:31,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:31:31,621 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:31,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:31:31,660 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 23:31:31,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-10 23:31:31,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-10 23:31:31,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 23:31:31,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:31:31,714 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:31:31,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-01-10 23:31:31,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-10 23:31:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 23:31:31,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:32,161 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:32,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 147 [2022-01-10 23:31:32,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 172 [2022-01-10 23:31:32,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 166 [2022-01-10 23:31:32,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-10 23:31:32,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-01-10 23:31:32,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-01-10 23:31:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 23:31:32,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910584328] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:32,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:32,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-10 23:31:32,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877418984] [2022-01-10 23:31:32,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:32,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 23:31:32,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 23:31:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-01-10 23:31:32,422 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2022-01-10 23:31:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:33,226 INFO L93 Difference]: Finished difference Result 322 states and 452 transitions. [2022-01-10 23:31:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 23:31:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) Word has length 55 [2022-01-10 23:31:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:33,228 INFO L225 Difference]: With dead ends: 322 [2022-01-10 23:31:33,228 INFO L226 Difference]: Without dead ends: 236 [2022-01-10 23:31:33,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 23:31:33,229 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 241 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:33,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 596 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 566 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2022-01-10 23:31:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-10 23:31:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2022-01-10 23:31:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.217687074829932) internal successors, (179), 155 states have internal predecessors, (179), 18 states have call successors, (18), 9 states have call predecessors, (18), 21 states have return successors, (59), 23 states have call predecessors, (59), 18 states have call successors, (59) [2022-01-10 23:31:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 256 transitions. [2022-01-10 23:31:33,251 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 256 transitions. Word has length 55 [2022-01-10 23:31:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:33,251 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 256 transitions. [2022-01-10 23:31:33,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 8 states have call successors, (10) [2022-01-10 23:31:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 256 transitions. [2022-01-10 23:31:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 23:31:33,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:33,252 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:33,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:33,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:33,469 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:31:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1328689944, now seen corresponding path program 2 times [2022-01-10 23:31:33,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:33,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537922128] [2022-01-10 23:31:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:33,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 23:31:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-10 23:31:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 23:31:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 23:31:34,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537922128] [2022-01-10 23:31:34,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537922128] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408975261] [2022-01-10 23:31:34,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:31:34,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:34,003 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:31:34,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 23:31:34,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:31:34,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:31:34,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 23:31:34,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:34,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:34,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:31:34,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2022-01-10 23:31:34,406 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-01-10 23:31:34,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 38 [2022-01-10 23:31:34,512 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:31:34,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 23:31:34,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,611 INFO L353 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-01-10 23:31:34,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2022-01-10 23:31:34,740 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:34,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:31:34,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:34,868 INFO L353 Elim1Store]: treesize reduction 173, result has 15.6 percent of original size [2022-01-10 23:31:34,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 106 treesize of output 116 [2022-01-10 23:31:34,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-01-10 23:31:34,900 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-10 23:31:34,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 64 [2022-01-10 23:31:34,960 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 23:31:34,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 129 [2022-01-10 23:31:35,004 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:31:35,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 112 [2022-01-10 23:31:35,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 67 [2022-01-10 23:31:37,206 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_ULTIMATE.start_main_~tail~0#1.offsetInt| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15|))) (and (< (+ (select .cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~tail~0#1.offsetInt| 8) 18446744073709551616)) 1) |v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15|) (= (select .cse0 8) 0)))) (exists ((|v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15| Int)) (< (+ (select (select |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15|) 8) 1) |v_ULTIMATE.start_ULTIMATE.start_main_~#list~0#1.baseInt_BEFORE_CALL_15|))) is different from true [2022-01-10 23:31:45,263 WARN L228 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)