/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_BITWISE.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:50:54,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:50:54,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:50:54,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:50:54,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:50:54,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:50:54,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:50:54,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:50:54,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:50:54,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:50:54,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:50:54,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:50:54,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:50:54,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:50:54,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:50:54,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:50:54,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:50:54,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:50:54,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:50:54,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:50:54,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:50:54,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:50:54,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:50:54,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:50:54,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:50:54,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:50:54,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:50:54,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:50:54,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:50:54,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:50:54,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:50:54,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:50:54,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:50:54,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:50:54,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:50:54,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:50:54,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:50:54,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:50:54,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:50:54,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:50:54,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:50:54,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:50:54,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:50:54,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:50:54,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:50:54,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:50:54,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:50:54,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:50:54,294 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:50:54,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:50:54,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:50:54,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:50:54,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:50:54,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:50:54,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:50:54,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:50:54,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:50:54,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:50:54,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:50:54,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:50:54,297 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:50:54,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:50:54,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:50:54,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:50:54,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:50:54,507 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:50:54,507 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 11:50:54,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d647fdec/59c79ca99953486dae137980428ae846/FLAG5400e1185 [2022-01-10 11:50:54,902 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:50:54,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dancing.i [2022-01-10 11:50:54,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d647fdec/59c79ca99953486dae137980428ae846/FLAG5400e1185 [2022-01-10 11:50:55,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d647fdec/59c79ca99953486dae137980428ae846 [2022-01-10 11:50:55,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:50:55,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:50:55,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:50:55,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:50:55,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:50:55,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da05320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55, skipping insertion in model container [2022-01-10 11:50:55,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:50:55,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:50:55,462 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 11:50:55,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:50:55,612 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:50:55,620 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 11:50:55,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:50:55,731 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:50:55,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55 WrapperNode [2022-01-10 11:50:55,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:50:55,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:50:55,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:50:55,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:50:55,759 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:50:55" (1/1) ... [2022-01-10 11:50:55,769 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:50:55" (1/1) ... [2022-01-10 11:50:55,802 INFO L137 Inliner]: procedures = 125, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2022-01-10 11:50:55,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:50:55,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:50:55,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:50:55,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:50:55,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:50:55,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:50:55,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:50:55,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:50:55,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (1/1) ... [2022-01-10 11:50:55,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:50:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:50:55,919 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 11:50:55,937 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 11:50:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-01-10 11:50:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-01-10 11:50:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:50:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:50:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 11:50:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:50:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:50:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:50:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:50:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:50:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:50:56,154 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:50:56,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:50:56,372 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:50:56,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:50:56,376 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 11:50:56,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:50:56 BoogieIcfgContainer [2022-01-10 11:50:56,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:50:56,378 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:50:56,378 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:50:56,381 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:50:56,393 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:50:56" (1/1) ... [2022-01-10 11:50:56,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:50:56 BasicIcfg [2022-01-10 11:50:56,517 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:50:56,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:50:56,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:50:56,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:50:56,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:50:55" (1/4) ... [2022-01-10 11:50:56,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24de7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:50:56, skipping insertion in model container [2022-01-10 11:50:56,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:55" (2/4) ... [2022-01-10 11:50:56,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24de7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:50:56, skipping insertion in model container [2022-01-10 11:50:56,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:50:56" (3/4) ... [2022-01-10 11:50:56,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24de7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:50:56, skipping insertion in model container [2022-01-10 11:50:56,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:50:56" (4/4) ... [2022-01-10 11:50:56,523 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.iTransformedIcfg [2022-01-10 11:50:56,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:50:56,526 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 11:50:56,570 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:50:56,576 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 11:50:56,576 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 11:50:56,586 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 11:50:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:50:56,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:56,590 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 11:50:56,591 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1870213, now seen corresponding path program 1 times [2022-01-10 11:50:56,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:56,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397517571] [2022-01-10 11:50:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:56,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:56,800 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 11:50:56,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:56,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397517571] [2022-01-10 11:50:56,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397517571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:56,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:56,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:50:56,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137188564] [2022-01-10 11:50:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:56,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:50:56,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:50:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:50:56,827 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 11:50:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:56,840 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-01-10 11:50:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:50:56,842 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 11:50:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:56,846 INFO L225 Difference]: With dead ends: 77 [2022-01-10 11:50:56,846 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 11:50:56,848 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 11:50:56,853 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 11:50:56,854 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 11:50:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 11:50:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 11:50:56,884 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 11:50:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 11:50:56,887 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 19 [2022-01-10 11:50:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:56,888 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 11:50:56,888 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 11:50:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 11:50:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:50:56,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:56,891 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 11:50:56,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:50:56,892 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1154925979, now seen corresponding path program 1 times [2022-01-10 11:50:56,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511110514] [2022-01-10 11:50:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:56,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,058 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 11:50:57,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:57,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511110514] [2022-01-10 11:50:57,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511110514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:57,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:57,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:50:57,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012562248] [2022-01-10 11:50:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:57,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:50:57,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:50:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:50:57,061 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 11:50:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:57,101 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-01-10 11:50:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:50:57,102 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 11:50:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:57,104 INFO L225 Difference]: With dead ends: 42 [2022-01-10 11:50:57,104 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 11:50:57,107 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 11:50:57,109 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 11:50:57,109 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 11:50:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 11:50:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-10 11:50:57,121 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 11:50:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-01-10 11:50:57,127 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 19 [2022-01-10 11:50:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:57,128 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-01-10 11:50:57,128 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 11:50:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-01-10 11:50:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:50:57,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:57,129 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 11:50:57,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:50:57,129 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2029966424, now seen corresponding path program 1 times [2022-01-10 11:50:57,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775025803] [2022-01-10 11:50:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:57,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 11:50:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,277 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 11:50:57,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775025803] [2022-01-10 11:50:57,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775025803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:57,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:57,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:50:57,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825985942] [2022-01-10 11:50:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:57,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:50:57,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:50:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:50:57,281 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 11:50:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:57,344 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-01-10 11:50:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:50:57,344 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 11:50:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:57,345 INFO L225 Difference]: With dead ends: 87 [2022-01-10 11:50:57,345 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 11:50:57,346 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 11:50:57,346 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 11:50:57,347 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 11:50:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 11:50:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-01-10 11:50:57,351 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 11:50:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-01-10 11:50:57,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 25 [2022-01-10 11:50:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:57,352 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-01-10 11:50:57,353 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 11:50:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-01-10 11:50:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 11:50:57,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:57,354 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 11:50:57,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:50:57,354 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -865419746, now seen corresponding path program 1 times [2022-01-10 11:50:57,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726659296] [2022-01-10 11:50:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:57,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:50:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 11:50:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,481 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 11:50:57,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726659296] [2022-01-10 11:50:57,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726659296] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:50:57,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198150863] [2022-01-10 11:50:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:57,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:50:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:50:57,483 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 11:50:57,484 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 11:50:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:57,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 11:50:57,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:50:57,688 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 11:50:57,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:50:57,853 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 11:50:57,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198150863] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:50:57,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:50:57,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-01-10 11:50:57,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271793180] [2022-01-10 11:50:57,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:50:57,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 11:50:57,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 11:50:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-10 11:50:57,855 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 11:50:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:58,065 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2022-01-10 11:50:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:50:58,065 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 11:50:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:58,067 INFO L225 Difference]: With dead ends: 120 [2022-01-10 11:50:58,067 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 11:50:58,067 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 11:50:58,068 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 128 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 11:50:58,068 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 11:50:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 11:50:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2022-01-10 11:50:58,075 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 11:50:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2022-01-10 11:50:58,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2022-01-10 11:50:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:58,076 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2022-01-10 11:50:58,076 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 11:50:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2022-01-10 11:50:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 11:50:58,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:58,077 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 11:50:58,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 11:50:58,291 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 11:50:58,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1349804752, now seen corresponding path program 1 times [2022-01-10 11:50:58,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:58,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511011331] [2022-01-10 11:50:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:58,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:50:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 11:50:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,352 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 11:50:58,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:58,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511011331] [2022-01-10 11:50:58,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511011331] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:50:58,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925325390] [2022-01-10 11:50:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:58,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:50:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:50:58,353 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 11:50:58,375 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 11:50:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 11:50:58,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:50:58,536 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 11:50:58,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 11:50:58,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925325390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:58,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:50:58,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2022-01-10 11:50:58,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778300317] [2022-01-10 11:50:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:58,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:50:58,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:50:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:50:58,538 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 11:50:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:58,560 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-01-10 11:50:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:50:58,560 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 11:50:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:58,562 INFO L225 Difference]: With dead ends: 114 [2022-01-10 11:50:58,562 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 11:50:58,562 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 11:50:58,564 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 11:50:58,565 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 11:50:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 11:50:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-10 11:50:58,582 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 11:50:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2022-01-10 11:50:58,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 30 [2022-01-10 11:50:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:58,586 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2022-01-10 11:50:58,586 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 11:50:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2022-01-10 11:50:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 11:50:58,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:58,590 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 11:50:58,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 11:50:58,803 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 11:50:58,803 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1174107104, now seen corresponding path program 1 times [2022-01-10 11:50:58,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:58,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973487402] [2022-01-10 11:50:58,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:58,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 11:50:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:58,896 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 11:50:58,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973487402] [2022-01-10 11:50:58,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973487402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:58,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:58,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:50:58,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030681774] [2022-01-10 11:50:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:58,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:50:58,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:50:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:50:58,897 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 11:50:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:58,913 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-01-10 11:50:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:50:58,913 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 11:50:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:58,914 INFO L225 Difference]: With dead ends: 67 [2022-01-10 11:50:58,914 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 11:50:58,914 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 11:50:58,914 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 11:50:58,915 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 11:50:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 11:50:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-01-10 11:50:58,918 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 11:50:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-01-10 11:50:58,919 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 31 [2022-01-10 11:50:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:58,919 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-01-10 11:50:58,919 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 11:50:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-01-10 11:50:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 11:50:58,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:58,920 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 11:50:58,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:50:58,920 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1346828331, now seen corresponding path program 1 times [2022-01-10 11:50:58,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:58,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384797605] [2022-01-10 11:50:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:58,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 11:50:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,171 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 11:50:59,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384797605] [2022-01-10 11:50:59,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384797605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:59,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:59,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:50:59,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126467219] [2022-01-10 11:50:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:59,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:50:59,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:50:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:50:59,172 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 11:50:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:59,266 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2022-01-10 11:50:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:50:59,268 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 11:50:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:59,268 INFO L225 Difference]: With dead ends: 94 [2022-01-10 11:50:59,268 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 11:50:59,269 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 11:50:59,269 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 11:50:59,270 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 11:50:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 11:50:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 11:50:59,274 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 11:50:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-01-10 11:50:59,274 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 32 [2022-01-10 11:50:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:59,275 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-01-10 11:50:59,275 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 11:50:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-01-10 11:50:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 11:50:59,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:59,275 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 11:50:59,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 11:50:59,276 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -776107193, now seen corresponding path program 1 times [2022-01-10 11:50:59,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668533985] [2022-01-10 11:50:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:59,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:50:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 11:50:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,461 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 11:50:59,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668533985] [2022-01-10 11:50:59,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668533985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:50:59,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:50:59,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:50:59,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807407539] [2022-01-10 11:50:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:50:59,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:50:59,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:50:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:50:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:50:59,462 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 11:50:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:50:59,531 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-01-10 11:50:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:50:59,531 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 11:50:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:50:59,532 INFO L225 Difference]: With dead ends: 53 [2022-01-10 11:50:59,532 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 11:50:59,533 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 11:50:59,533 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 11:50:59,533 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 11:50:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 11:50:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-01-10 11:50:59,546 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 11:50:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2022-01-10 11:50:59,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 36 [2022-01-10 11:50:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:50:59,547 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2022-01-10 11:50:59,547 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 11:50:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-01-10 11:50:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 11:50:59,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:50:59,548 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 11:50:59,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 11:50:59,548 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:50:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:50:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1848763390, now seen corresponding path program 1 times [2022-01-10 11:50:59,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:50:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516820793] [2022-01-10 11:50:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:59,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:50:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:50:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 11:50:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:50:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:50:59,985 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 11:50:59,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:50:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516820793] [2022-01-10 11:50:59,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516820793] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:50:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126047503] [2022-01-10 11:50:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:50:59,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:50:59,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:00,007 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 11:51:00,008 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 11:51:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:00,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 11:51:00,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:00,300 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 11:51:00,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:00,307 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 11:51:00,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:00,317 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 11:51:00,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:00,322 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 11:51:00,613 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:00,613 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 11:51:00,623 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:00,624 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 11:51:01,189 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 11:51:01,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:01,281 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 11:51:01,518 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 11:51:01,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:01,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:01,790 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 11:51:01,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:01,816 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:01,816 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 11:51:01,827 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:01,827 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 11:51:01,845 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 11:51:01,854 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:01,875 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 11:51:01,881 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 11:51:02,147 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 11:51:02,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126047503] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:02,147 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:02,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 33 [2022-01-10 11:51:02,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144415891] [2022-01-10 11:51:02,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:02,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 11:51:02,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 11:51:02,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 11:51:02,149 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 11:51:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:02,994 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2022-01-10 11:51:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 11:51:02,995 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 11:51:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:02,996 INFO L225 Difference]: With dead ends: 165 [2022-01-10 11:51:02,996 INFO L226 Difference]: Without dead ends: 126 [2022-01-10 11:51:02,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2022-01-10 11:51:02,998 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 274 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 11:51:02,998 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 11:51:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-10 11:51:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 66. [2022-01-10 11:51:03,007 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 11:51:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2022-01-10 11:51:03,008 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 42 [2022-01-10 11:51:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:03,008 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2022-01-10 11:51:03,008 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 11:51:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2022-01-10 11:51:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 11:51:03,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:03,009 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 11:51:03,029 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 11:51:03,209 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 11:51:03,209 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:03,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2060114303, now seen corresponding path program 1 times [2022-01-10 11:51:03,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:03,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478141670] [2022-01-10 11:51:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:03,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:51:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 11:51:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:04,062 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 11:51:04,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:04,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478141670] [2022-01-10 11:51:04,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478141670] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:04,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423144781] [2022-01-10 11:51:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:04,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:04,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:04,076 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 11:51:04,130 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 11:51:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:04,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-10 11:51:04,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:04,386 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 11:51:04,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:04,390 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 11:51:04,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:04,404 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 11:51:04,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:04,409 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 11:51:05,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:05,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:05,069 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 11:51:05,070 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 11:51:05,072 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 11:51:08,495 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 11:51:08,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:09,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:09,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,385 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 11:51:09,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:09,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,396 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 11:51:09,433 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,433 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 11:51:09,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:09,453 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 11:51:09,470 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 11:51:09,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:09,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,505 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 11:51:10,276 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 11:51:10,393 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 11:51:10,474 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 11:51:10,551 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:10,757 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 11:51:11,101 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 11:51:11,529 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 11:51:11,565 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 11:51:11,595 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 11:51:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:12,792 INFO L353 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-01-10 11:51:12,793 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 11:51:14,900 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 11:51:14,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423144781] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:14,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:14,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 42 [2022-01-10 11:51:14,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233870371] [2022-01-10 11:51:14,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:14,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 11:51:14,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 11:51:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1575, Unknown=6, NotChecked=0, Total=1722 [2022-01-10 11:51:14,904 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 11:51:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:21,154 INFO L93 Difference]: Finished difference Result 171 states and 219 transitions. [2022-01-10 11:51:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-10 11:51:21,155 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 11:51:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:21,156 INFO L225 Difference]: With dead ends: 171 [2022-01-10 11:51:21,156 INFO L226 Difference]: Without dead ends: 125 [2022-01-10 11:51:21,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=381, Invalid=4026, Unknown=15, NotChecked=0, Total=4422 [2022-01-10 11:51:21,158 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 11:51:21,158 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 11:51:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-10 11:51:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-01-10 11:51:21,171 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 11:51:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2022-01-10 11:51:21,172 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 42 [2022-01-10 11:51:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:21,172 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2022-01-10 11:51:21,173 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 11:51:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2022-01-10 11:51:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 11:51:21,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:21,174 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 11:51:21,214 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 11:51:21,387 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 11:51:21,387 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -64349558, now seen corresponding path program 1 times [2022-01-10 11:51:21,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:21,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131232253] [2022-01-10 11:51:21,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:21,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:51:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 11:51:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:21,474 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 11:51:21,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131232253] [2022-01-10 11:51:21,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131232253] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000251804] [2022-01-10 11:51:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:21,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:21,475 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 11:51:21,479 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 11:51:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:21,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 11:51:21,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:21,630 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 11:51:21,641 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:21,641 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 11:51:21,737 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 11:51:21,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:21,819 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 11:51:21,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000251804] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:21,819 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:21,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-10 11:51:21,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434472641] [2022-01-10 11:51:21,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:21,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 11:51:21,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:21,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 11:51:21,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:51:21,820 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 11:51:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:21,912 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-01-10 11:51:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:51:21,912 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 11:51:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:21,913 INFO L225 Difference]: With dead ends: 124 [2022-01-10 11:51:21,913 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 11:51:21,913 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 11:51:21,914 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 11:51:21,914 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 11:51:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 11:51:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-01-10 11:51:21,922 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 11:51:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-01-10 11:51:21,923 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 42 [2022-01-10 11:51:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:21,923 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-01-10 11:51:21,923 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 11:51:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-01-10 11:51:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 11:51:21,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:21,924 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 11:51:21,943 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 11:51:22,141 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 11:51:22,141 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1869121874, now seen corresponding path program 1 times [2022-01-10 11:51:22,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:22,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39324325] [2022-01-10 11:51:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:22,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:51:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 11:51:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,234 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 11:51:22,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39324325] [2022-01-10 11:51:22,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39324325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:22,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:22,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:51:22,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880176822] [2022-01-10 11:51:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:22,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:51:22,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:51:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:51:22,237 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 11:51:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:22,277 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2022-01-10 11:51:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 11:51:22,278 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 11:51:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:22,280 INFO L225 Difference]: With dead ends: 110 [2022-01-10 11:51:22,280 INFO L226 Difference]: Without dead ends: 108 [2022-01-10 11:51:22,280 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 11:51:22,281 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 11:51:22,281 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 11:51:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-10 11:51:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2022-01-10 11:51:22,292 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 11:51:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-01-10 11:51:22,293 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 43 [2022-01-10 11:51:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:22,293 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-01-10 11:51:22,293 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 11:51:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-01-10 11:51:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 11:51:22,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:22,294 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 11:51:22,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 11:51:22,294 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1386558423, now seen corresponding path program 2 times [2022-01-10 11:51:22,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:22,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995327678] [2022-01-10 11:51:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:22,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 11:51:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-10 11:51:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:23,566 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 11:51:23,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:23,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995327678] [2022-01-10 11:51:23,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995327678] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:23,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457743295] [2022-01-10 11:51:23,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:23,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:23,580 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 11:51:23,627 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 11:51:23,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:23,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:23,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 132 conjunts are in the unsatisfiable core [2022-01-10 11:51:23,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:23,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:23,999 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 11:51:24,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,005 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 11:51:24,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,104 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 11:51:24,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,107 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 11:51:24,110 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 11:51:24,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,116 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 11:51:24,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,128 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 11:51:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:24,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:24,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:24,884 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 11:51:24,885 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 11:51:24,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:24,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:24,893 INFO L353 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-01-10 11:51:24,893 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 11:51:26,369 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 11:51:26,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:36,288 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 11:51:36,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457743295] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:36,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:36,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 20] total 54 [2022-01-10 11:51:36,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564177184] [2022-01-10 11:51:36,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:36,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-10 11:51:36,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-10 11:51:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2642, Unknown=5, NotChecked=0, Total=2862 [2022-01-10 11:51:36,305 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 11:51:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:49,125 INFO L93 Difference]: Finished difference Result 349 states and 484 transitions. [2022-01-10 11:51:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-10 11:51:49,126 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 11:51:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:49,130 INFO L225 Difference]: With dead ends: 349 [2022-01-10 11:51:49,130 INFO L226 Difference]: Without dead ends: 270 [2022-01-10 11:51:49,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=759, Invalid=9537, Unknown=6, NotChecked=0, Total=10302 [2022-01-10 11:51:49,137 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 363 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:49,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 2115 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1972 Invalid, 0 Unknown, 365 Unchecked, 3.5s Time] [2022-01-10 11:51:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-10 11:51:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 179. [2022-01-10 11:51:49,167 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 11:51:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2022-01-10 11:51:49,168 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 49 [2022-01-10 11:51:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:49,168 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2022-01-10 11:51:49,168 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 11:51:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2022-01-10 11:51:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 11:51:49,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:49,170 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 11:51:49,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 11:51:49,383 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 11:51:49,383 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 359108921, now seen corresponding path program 1 times [2022-01-10 11:51:49,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:49,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399101337] [2022-01-10 11:51:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:49,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 11:51:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-10 11:51:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:50,008 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 11:51:50,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399101337] [2022-01-10 11:51:50,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399101337] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985948711] [2022-01-10 11:51:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:50,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:50,020 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 11:51:50,021 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 11:51:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:50,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-10 11:51:50,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:50,320 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 11:51:50,365 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:50,366 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 11:51:50,402 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-10 11:51:50,403 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 11:51:50,406 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 11:51:50,410 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 11:51:50,424 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 11:51:50,449 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:51:50,449 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 11:51:50,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, 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 11:51:50,611 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 11:51:50,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:50,844 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:50,844 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 11:51:50,848 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 11:51:50,851 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 11:51:50,903 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 11:51:50,908 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 11:51:51,091 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 11:51:51,141 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 11:51:51,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985948711] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:51,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:51,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-10 11:51:51,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320290228] [2022-01-10 11:51:51,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:51,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 11:51:51,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 11:51:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-01-10 11:51:51,143 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 11:51:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:51,898 INFO L93 Difference]: Finished difference Result 322 states and 452 transitions. [2022-01-10 11:51:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 11:51:51,899 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 11:51:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:51,900 INFO L225 Difference]: With dead ends: 322 [2022-01-10 11:51:51,900 INFO L226 Difference]: Without dead ends: 236 [2022-01-10 11:51:51,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 11:51:51,901 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 241 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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 11:51:51,901 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 11:51:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-10 11:51:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2022-01-10 11:51:51,932 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 11:51:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 256 transitions. [2022-01-10 11:51:51,933 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 256 transitions. Word has length 55 [2022-01-10 11:51:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:51,933 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 256 transitions. [2022-01-10 11:51:51,934 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 11:51:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 256 transitions. [2022-01-10 11:51:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 11:51:51,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:51,935 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 11:51:51,960 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 11:51:52,150 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 11:51:52,151 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1328689944, now seen corresponding path program 2 times [2022-01-10 11:51:52,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:52,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695243651] [2022-01-10 11:51:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:52,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 11:51:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-10 11:51:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 11:51:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:52,757 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 11:51:52,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695243651] [2022-01-10 11:51:52,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695243651] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842239028] [2022-01-10 11:51:52,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:52,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:52,758 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 11:51:52,759 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 11:51:53,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:53,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:53,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 11:51:53,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:53,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,094 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 11:51:53,125 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 11:51:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,166 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 11:51:53,177 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-01-10 11:51:53,177 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 11:51:53,289 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:53,289 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 11:51:53,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,367 INFO L353 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-01-10 11:51:53,367 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 11:51:53,542 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:53,543 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 11:51:53,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:53,664 INFO L353 Elim1Store]: treesize reduction 173, result has 15.6 percent of original size [2022-01-10 11:51:53,664 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 11:51:53,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:51:53,690 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-10 11:51:53,690 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 11:51:53,732 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 11:51:53,732 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 11:51:53,773 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:51:53,774 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 11:51:53,776 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 11:51:55,969 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 11:52:04,022 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)